You may use bucket sort if extra space is enough. Second approach - find (log n)-th statistic and then (log n + sqrt n). After doing so you may output all students that have marks below corresponding bounds. There is O(n) algorithm for finding such values.
-- 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.
