Loading...
Engaged employer
What is the most efficient sorting algorithm? What is its runtime?
Anonymous
depends on the size of the list
quickSort, it has O(n log n) time complexity in the average case, but yes at the end of the day it depends on the size of the input
Check out your Company Bowl for anonymous work chats.
Get actionable career advice tailored to you by joining more bowls.
Stay ahead in opportunities and insider tips by following your dream companies.
Get personalised job recommendations and updates by starting your searches.