find the first three largest nos. and 3 smallest number(negatives).. then easily you can fig. out the solution..
O(6n) solution i guess which is 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 [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.
