Quicksort in Real Life
This video shows an example on using a quicksort algorithm to sort 7 cards. Quicksort is a sorting algorithm with a big O notation of (n log n) on average, although in practice is often even faster than other (n log n) algorithms. The code for quicksort is more complicated than others such as bubble sort but the results are much better, specially when looking to sort big amounts of items.
Thanks for watching, if you have any questions please post them in the comments.