As said by someone already.. inorder to find min and max values it takes O(n^2).. so i think there is no better solution below O(n^2)
On Mon, Jul 18, 2011 at 10:01 PM, sunny agrawal <[email protected]>wrote: > if i am not getting question wrong..... > read only 3 rows > find min and max of these 3n numbers > as min and max will be only in one lines output the line without min and > max > > > On Mon, Jul 18, 2011 at 9:55 PM, SkRiPt KiDdIe <[email protected]>wrote: > >> Reading the input will cost n^2 >>> >> >> -- >> 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. > -- 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.
