0
Which sorting algorithm (in its optimized form, with an early-exit flag) has a best-case time complexity of O(n) when the input array is already sorted?
- ASelection sort
- BBubble sort
- CHeap sort
- DMerge sort
Correct answer: B
Discussion 0
Log in or create a free account to reply and vote.
Nobody has replied yet. Start the discussion!