you didn't answer my questions... I still think you can't do below O(n ^ 2) can provide code for your program...
On Mon, Jul 18, 2011 at 10:35 PM, ankit sambyal <ankitsamb...@gmail.com>wrote: > @Swathi : Suppose u read 3 rows. Find the minimum and maximum element > from the elements read from 3 rows. 2 cases arise: > 1. Min and Max element belong to 1 row > 2. Min and Max belong to 2 rows > In both the cases we can get the row which do not contain minnimum and > maximum element from the 3 rows read. If that row does not contain > minimum and maximum element from 3 rows, it won't contain maximum and > minimum element from N rows > > -- > 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?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 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?hl=en.
