n+lgn-2 no of comparisions will do On Thu, Jul 14, 2011 at 10:19 AM, shiv narayan <[email protected]>wrote:
> Describe an optimal algorithm to find the second minimum number in an > array of numbers. What is the exact number of comparisons required in > the worst case? Note that they didn't ask the order in Big-Oh > notation. They wanted the exact number of comparisons. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Sunny Aggrawal B-Tech IV year,CSI Indian Institute Of Technology,Roorkee -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
