hai guys these questions were asked in anna university onsite programming
contest.
1) find the second biggest number in a given array of size n. you have to
use n+logn number of searches or less

2) how will you find out if a number is repeated  (n/2+1) times in an array
of size n? the complexity should be o(n).

--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---

Reply via email to