class question
Moonwalk_ (0)

when will O(n) > O(nlog2n) + O(log2n) if O(n) is speed of fastest search to find an item in an unsorted list, O(nlog2n) is speed of fastest sorting algorithm and O(log2n) is speed of fastest search to find an item in a sorted list.

You are viewing a single comment. View All
ReplTalk (527)

Hey there, please make sure your post body is at least 10 words and 100 characters. That makes it easier for our community to help you!