Given n integers, how can you determine the largest and the second largest in n + logn comparisons. Note it is not O(n + logn)which is equal to O(n)
Labels: algorithms, interview
Algorithms, Code, Programming languages, Security, and lots more
Given n integers, how can you determine the largest and the second largest in n + logn comparisons. Note it is not O(n + logn)which is equal to O(n)
Labels: algorithms, interview
0 Comments:
Post a Comment
Subscribe to Post Comments [Atom]
<< Home