Insertion Sort Demonstration

Insertion Sort Demonstration

What Is Insertion Sort?

Insertion sort works like sorting playing cards in your hands:

  1. Start with the second number.
  2. Compare it with the one before.
  3. If it’s smaller, move the bigger one to the right.
  4. Keep doing this until the smaller number finds its correct place.
  5. Repeat this for every number in the list.

Read More

Insertion Sort Demonstration

Binary Search Demonstration

Linear Search Demonstration

Selection Sort Demonstration

Quick Sort Demonstration

Leave a comment