You need help with part b. I have the majority of it done just need tweaks to the code. This is in java and the linked list has to be created and cannot use the Java API list classes. You have to sort an array of student-ids. Student ids have a range 1- 99999.
Write a program to sort the following student id's in ascending order using radix (bucket) sort and print the sorted list on console. You are not allowed to use Java API list classes.
Repeat the same sort with the same input using 100 buckets numbered 0..99 instead of 10 buckets. For the 100 buckets you should look at two digits at a time in every pass for every number starting from the least significant position. So 8178 would go to bucket #78 in pass 1 and bucket #81 in pass 2.
You must the print out of the contents of each bucket after every pass to and the final sorted list, as shown in the example in part a) to get full credit.