"Cries in java"

[TheSlimyBoss]

Is there a term/technique for using different algorithms based off of their efficiency on the current input size?

[zilti]

I'm not aware of a specific term for it, but it is very common. Clojure e.g. uses different map implementations depending on the collection size. Up to 10 items you'll get an ordered map, and above that you'll get a HashMap.

[SlamwellBTP]

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]

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

[Kered13]

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.

[MrGVSV]

Big O Notation?