Introsort

Introsort is a sorting algorithm whichcombines elements of both quicksort and heapsort. It starts by using quicksort to sort numbers, but if it takes too long, it switches to heapsort which takes less time. During the sorting process, the algorithm checks how much time it's taking and if it notices that it's taking too long, it switches to heapsort to finish the job. Introsort is faster than quicksort and heapsort by themselves.