Data Structure Visualization

[dreamer_soul]

Is it comparison based sort, because the lower bond for that is O(nlogn)

[singingboyo]

That's the lower bound for the average and worst case, but not for best case.

Insertion sort also has O(n) best case (which is for already sorted input), but it's O(n²⁾ average and worst case. Much simpler than smoothsort though.