A detailed description of the Radix sort algorithm, including a code solution written in the C programming language and an interactive animation / visualization of the sort at work.

A description of finding data in an ordered collection using a binary search algorithm.

Detailed lesson plan explains how to use the partial quotients algorithm for solving division problems and understanding the process involved.

This puzzle shows students the decisions involved in linking a network between houses in a muddy city. It can lead on to a discussion of minimal spanning tree algorithms for optimizing networks.

A description of the Radix sorting algorithm with an interactive demonstration.

Detailed math tutorial features notes and examples that take a look at the basics dividing polynomials, introduces synthetic division, and gives the Division Algorithm.

An in-depth discussion of the algorithm design language known as pseudocode.

A practice project applying recursive algorithms.

Learn how to improve the efficiency of recursive algorithms.

Learn how a quicksort uses divide-and-conquer, and so it's a recursive algorithm.

Learn how binary search is an efficient algorithm for finding an item from a sorted list of items.

If you're the kind of person who has taken apart your Rubik's cube in order to grease the inside parts so it will move more smoothly, this could be a great project for you. This will show you three sets of move sequences that accomplish...

Student groups use the Java programming language to implement the algorithms for optical character recognition (OCR) that they developed in the associated lesson. The ultimate goal is to produce computer code that recognizes a digit on a...

Computational thinking can be used to take a complex problem, understand what the problem is and develop possible solutions to solve or explain it. In these six Quest, students will learn about the four stages of computational thinking:...

After learning about algorithms, find out what to learn next.

This Khan Academy resource is an article about a game that gives you an idea of how different algorithms for the same problem can have wildly different efficiencies. The computer is going to randomly select an integer from 1 to 15....

In this lesson on subtraction, students will use the break apart strategy, draw a model, or the standard algorithm to subtract 3-digit numbers.

Describes bottom-up design methodology and differentiates it from top-down procedures. Contains some questions to help choose a particular methodology.

This paper surveys recent advances obtained for the two-dimensional bin packing problem, with special emphasis on exact algorithms and effective heuristic and metaheuristic approaches.

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...

Hi, I'm Yann Dauphin. I design and code artificial intelligence algorithms that can learn from examples. They are like programs that can program themselves. I spend most of my time discussing new ideas for algorithms, coding in Python,...

Based off of the hit television show NUMB3RS, this lesson shows students an algorithm to find the day on which any date in the past or future, has or will land. The lesson begins with a manual "hammering out" of a few specified dates by...

This Northeast Parallel Architectures Center at Syracuse University site proivdes a general overview of the Taylor series methods, including a focus on the Taylor series algorithm.

A description of locating data in a collection with a sequential search algorithm.