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: / thecompscirocks
Follow me on Instagram: / thecompscirocks
Follow me on Facebook: / thecompscirocks
Some sources & further reading:
https://en.wikipedia.org/wiki/Hybrid_...
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/Inserti...
https://en.wikipedia.org/wiki/Merge_sort
http://www.cs.rpi.edu/~musser/gp/intr...
https://github.com/apple/swift/blob/m...
http://bigocheatsheet.com/
Watch video What Happens When You Call sort()? | Introsort Algorithm Explained online without registration, duration hours minute second in high quality. This video was added by user CSRocks 14 September 2017, don't forget to share it with your friends and acquaintances, it has been viewed on our site 7,717 once and liked it 144 people.