Simon showed us this guessing game where we had to guess the correct sequence of cards with numbers 1, 2, 3, 4 while the cards are all flipped upside down. It sound like a simple little thing but it has deep implications for understanding how sorting algorithms work.
It’s really about showing what the best sorting algorithm. No sorting algorithm that has a better worst-case scenario than
n log n.
Geeks out of the box 