Visualize
Each scene runs the algorithm on an input that you choose. You can step forward and back. The pseudocode shows the current line.
- Binary searchFind a key in a sorted array. Compare the key with the middle item, and keep only the half that can hold the key.
- Insertion sortSort an array one item at a time. Take the next item and move it left until the item before it is not larger.
- Merge sortSort an array by divide and conquer. Sort each half, then merge the two sorted halves into one sorted array.