CSRocks's video: What Happens When You Call sort Introsort Algorithm Explained

There are a dozen sorting algorithms, so which one is actually used when you call sort()? Every sorting algorithm has its shortcomings. Because of that, we don’t rely only on one of them but combine two or more together. A combination of two or more algorithms that solve the same problem is called hybrid algorithm. Languages such as Java or Python are using Timsort, which is derived from Merge sort and Insertion sort and is designed to perform well on many kinds of real-world data. C++ standard libraries, Microsoft .Net platform or Swift are using Introsort. Let’s take a closer look at it. Please Like and Subscribe for more weekly videos! Follow me on Twitter: https://twitter.com/thecompscirocks Follow me on Instagram: https://www.instagram.com/thecompscirocks/ Follow me on Facebook: https://www.facebook.com/thecompscirocks/ Some sources & further reading: https://en.wikipedia.org/wiki/Hybrid_algorithm https://en.wikipedia.org/wiki/Timsort https://en.wikipedia.org/wiki/Introsort https://en.wikipedia.org/wiki/Quicksort https://en.wikipedia.org/wiki/Heapsort https://en.wikipedia.org/wiki/Insertion_sort https://en.wikipedia.org/wiki/Merge_sort http://www.cs.rpi.edu/~musser/gp/introsort.ps https://github.com/apple/swift/blob/master/stdlib/public/core/Sort.swift.gyb http://bigocheatsheet.com/