use radix sort 4 times. using bucket sort with chaining as the sorting algorithm. time complexity= O(4(n+k)) space complexity = O(n) Ashima M.Sc.(Tech)Information Systems 4th year BITS Pilani Rajasthan
On Sun, Sep 25, 2011 at 6:01 AM, Jasveen Singh <jasveen.sing...@gmail.com>wrote: > i have a file 'star.txt' containing recordss in the form name score as > given below > *name score* > dave 52.67 > steve 60.09 > > and so on till 64 names > > i have to make a program to read and sort these names in a rank > just show not to store > all scores are in float and need to rank these names in a > order........consider these all students and teacher > need a program to rank their percentage in an order to announce ranks > lets see some algogeek magic........ > what i did was > create a static 2D array of 100 elements and store data from file in it > using file handling(obvious) > and then use a simple for loop ranking on 2nd line of array > > please need help guys > > -- > 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.
