A Wikipedia description of the Selection Sort algorithm.

A Wikipedia description of the Merge Sort algorithm.

A Wikipedia description of the Radix sort algorithm.

Students are challenged to multiply two, three, and four-digit numbers using the standard multiplication algorithm. They can set the number of digits in the multipliers, choose to have their quiz graded, or select new problems.

A concise explanation of the algorithm design language known as pseudocode.

[Free Registration/Login Required] This is a supplemental metric system flipchart I used with my students to reinforce previous classroom discussions. It contains an algorithm we developed in class, as well as, several practice problems...

Practice multiplying two numbers that are written to the tenths, hundredths, or thousandths place. Students receive immediate feedback and have the opportunity to try questions repeatedly, watch a video or receive hints.

Multiply two numbers. Factors are written to the ones, tenths, or hundredths place. Students receive immediate feedback and have the opportunity to try questions repeatedly, watch a video or receive hints.

A description of the linked list data structure.

The definition of an array data structure with links to array subtopics.

The DADS definition of the heap abstract data type.

The DADS description of the stack data structure.

The DADS description of the binary tree abstract data structure.

The DADS description of the set abstract data type.

A description of the hash table data structure.

The DADS description of the dictionary abstract data type.

Do you know what day of the week were you born? You can find the exact day when you try this math challenge that explores problem solving with algorithms. Find out how scientist and statisticians use algorithms in their jobs. A one page...

This site talks about how to check for the intersection of polygons. Computer programs calculating intersections are presented.

Decision trees are used for both classification and regression problems, this story we talk about classification.

Practice problems involving recursive algorithms.

An overview of the algorithm selection sort is given.

Recognition of the importance of algorithms in everyday life is illustrated.

Understanding the run efficiency time of algorithms and why timing is important.

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