咨询Clojure内置sort函数的时间复杂度（Big-O表示法）

Hey there! I totally get the frustration of not finding this detail on ClojureDocs—let me fill you in.

Clojure's built-in sort function delegates to Java's sorting implementations under the hood, which means its time complexity is O(n log n) in all cases (best, average, and worst). Here's a bit more context to clarify:

• For sequences of primitive types (like integers, floats), it uses Java's dual-pivot quicksort, which locks in an O(n log n) worst-case time complexity (a big improvement over traditional quicksort's worst-case O(n²)).
• For sequences of objects (like Clojure maps, strings, custom types), it uses TimSort—a hybrid sorting algorithm derived from merge sort and insertion sort—also with a worst-case time complexity of O(n log n).

One extra note: Clojure's sort is a stable sort, meaning elements with equal sort keys retain their original relative order in the output.

内容的提问来源于stack exchange，提问作者TheIE100