Ericsson interview question
What's the best case in terms for time-complexity for any sorting algorithm?
Interview Answer
Anonymous
24 Jan 2016
I believe the fastest any sorting algorithm can be is O(n-1). eg Bubble sort on a list of sorted numbers.
1