Class 11 · Computing & AIWorld

Algorithms & Sorting

Sort face-down cards with every comparison counted, halve a blind shelf, race five sorts on the same numbers, break quicksort, hash cards onto shelves, run Dijkstra by hand, and paint a map where BFS wades through mud while A* barely looks.