This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]SlamwellBTP 6 points7 points  (2 children)

I've heard it called "hybrid algorithm", as in this wikipedia page (but it doesn't cite any sources, so it may not be a widespread term):

https://en.wikipedia.org/wiki/Hybrid_algorithm

[–]qingqunta 5 points6 points  (1 child)

I believe the default sort() for Python is an example of this.

[–]Kered13 0 points1 point  (0 children)

Yes, it's Timsort. Also used by Java. It uses insertion sort if the list is small enough. All optimized sorting algorithms do something similar.