Computer Science Field Guide
Computer Science Field Guide
Imagine computer science all summed up in one book. This resource provides 16 chapters that cover many aspects of computer science, ranging from algorithms to software engineering. The e-book contains links to applets to help explain...
Paul Hamlyn Foundation
Work That Matters: The Teacher’s Guide to Project-Based Learning
Whether new to inquiry-based learning or experienced with its protocols, you'll find much to value in High Tech High's comprehensive guide to project-based learning. Designed for educators, the guide has everything instructors need to...
Khan Academy
Khan Academy: The Building Blocks of Algorithms
Learn the building blocks of algorithms in computer science.
Khan Academy
Khan Academy: Expressing an Algorithm
Learn how to express an algorithm many ways, including natural language, flow charts, pseudocode, and of course, actual programming languages.
![University of Texas: Fundamentals of the Analysis of Algorithm Efficiency [Pdf] eBook](https://d15y2dacu3jp90.cloudfront.net/images/attachment_defaults/resource/large/FPO-knovation.png "University of Texas: Fundamentals of the Analysis of Algorithm Efficiency [Pdf] eBook")
Other
University of Texas: Fundamentals of the Analysis of Algorithm Efficiency [Pdf]
A textbook chapter with an in-depth discussion of the analysis of algorithm efficiency, presented as a collection of slides.
Khan Academy
Khan Academy: Properties of Recursive Algorithms
Find out about the properties of recursive algorithms.
Khan Academy
Khan Academy: Improving Efficiency of Recursive Functions
Learn how to improve the efficiency of recursive algorithms.
Khan Academy
Khan Academy: Overview of Quicksort
Learn how a quicksort uses divide-and-conquer, and so it's a recursive algorithm.
Khan Academy
Khan Academy: Binary Search
Learn how binary search is an efficient algorithm for finding an item from a sorted list of items.
Other
University of Birmingham: "Top Down" and "Bottom Up" Design
Describes bottom-up design methodology and differentiates it from top-down procedures. Contains some questions to help choose a particular methodology.
Mathigon
Mathigon: Graphs and Networks: The Travelling Salesman Problem
This lesson focuses on the traveling salesman problem which involves finding paths through a city without backtracking. While no algorithm has been found to do that for all cities, there are algorithms that help somewhat. They are...
Khan Academy
Khan Academy: Representing Graphs
There are several ways to represent graphs, each with its advantages and disadvantages. Some situations, or algorithms that we want to run with graphs as input, call for one representation, and others call for a different representation....
Khan Academy
Khan Academy: Computing Powers of a Number
Although JavaScript has a built in pow function that computes powers of a number, learn how to write a similar function recursively.
Khan Academy
Khan Academy: Using Recursion to Determine Whether a Word Is a Palindrome
Learn how to use recursion to determine whether a word is a palindrome.
Khan Academy
Khan Academy: Multiple Recursion With the Sierpinski Gasket
See a good example of a mathematical construct that is a fractal known as a Sierpinski gasket.
Khan Academy
Khan Academy: The Factorial Function
See examples of recursion, and look how to compute the factorial function.
Khan Academy
Khan Academy: Recursion
Learn about recursion and how it applies to different situations.
Mathigon
Mathigon: Graphs and Networks: Graphs in Everyday Life
This lesson focuses on graphs in everyday life including virtual graphs such as the Internet or physical computer networks of computers. It puts graph theory into practice and provides examples and learning exercises.
Khan Academy
Khan Academy: Breadth First Search and Its Uses
A short tutorial for breadth-first search and its uses.
Other popular searches
- Numerical Algorithms
- Division Algorithm
- Multiplication Algorithms
- Addition With Algorithms
- Addition Algorithms
- Subtraction Algorithms
- Standard Algorithm
- Math With Algorithms
- Partial Products Algorithm
- Partial Sums Algorithm
- Adding Integers Algorithm
- Dividing Algorithm