The FASTEST sorting algorithm: Part 1 - TimSort

This video explains the Tim sort algorithm, which is the default sorting algorithm in Java and Python. The Tim sort algorithm is a hybrid of insertion sort and merge sort, and has some optimisations to help reduce the total operations required. We start by comparing various sorting algorithms and choosing a hybrid based on run time and asymptotic complexity. The resultant algorithm is faster than the naive merge sort or insertion sort approach. In the coming videos, we will improve on the algorithm as Tim sort does. #TimSort #Sorting #GauravSen Social links:   / gkcs0   https://www.quora.com/profile/Gaurav-... https://github.com/gkcs/Competitive-P...