You are viewing a single comment's thread. Return to all comments →
Binary Search on each remainder is O(nlogn). Array sort average is O(nlogn).
So the suggested solution is O(nlogn) instead of O(n). I think.
Seems like cookies are disabled on this browser, please enable them to open this website
Hash Tables: Ice Cream Parlor
You are viewing a single comment's thread. Return to all comments →
Binary Search on each remainder is O(nlogn). Array sort average is O(nlogn).
So the suggested solution is O(nlogn) instead of O(n). I think.