Introsort
id:
introsort-258-3744745
title:
Introsort
text:
Introsort or introspective sort is a hybrid sorting algorithm that provides both fast average performance and (asymptotically) optimal worst-case performance. It begins with quicksort, it switches to heapsort when the recursion depth exceeds a level based on (the logarithm of) the number of elements being sorted and it switches to insertion sort when the number of elements is below some threshold. This combines the good parts of the three algorithms, with practical performance comparable to quic
brand slug:
wiki
category slug:
encyclopedia
description:
Hybrid sorting algorithm
original url:
https://en.wikipedia.org/wiki/Introsort
date created:
date modified:
2024-04-09T03:35:55Z
main entity:
{"identifier":"Q1395653","url":"https://www.wikidata.org/entity/Q1395653"}
image:
fields total:
13
integrity:
14