I want an algo for finding second highest element in n + log n- 2 comparisons. The algo is first find the highest number and then highest among the number which get defeated during tournament. (details in corment).
Can anyone do code implemenation for this one. Thanks Nagendra --~--~---------~--~----~------------~-------~--~----~ 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 algogeeks+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
