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.comwrote:
i have a
yes i can do that but how do u want me to proceed if u can give me the code
to tell me how to fetch data from the file and use bucket sort on it
it will be a huge favour and am i right at my approach to use 2d array to
store the values
plz tell me sir plz!!
On Sun, Sep 25, 2011 at 1:08 PM, Ashima
i have a file 'star.txt' containing recordss in the form name score as given
below
*name score*
dave 52.67
steve60.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
