Many librarians will find this video extremely helpful. It explains how to alphabetize the bookshelf when the number of books is not ten or twenty, but one or two thousand.
The video, created by Anton Trofimov, accompanies a TED-Ed lesson by Chand John, where you can learn about the three popular sorting algorithms.
Two of them – Bubble Sort and Insertion Sort – are easy but take too much time. The last one is called Quick Sort. It’s the fastest way to sort books on a bookshelf, but also almost anything else.
The idea of Quick Sort is to pick up the random book (the partition), then place the books that come before it on the left, and the ones that come after – on the right. Then, you can repeat the process by picking up partitions within newly created segments.
Quick Sort is a fast and efficient sorting algorithm invented by Tony Hoare in 1959. It can be about two or three times faster than its main competitors, Merge Sort and Heap Sort.
More videos to check out: