You can try using the natural order in the collections framework or use array and iteration to achieve this. Depending on the list you have, just reversing it might not sort it from the highest to the lowest. You might want to swap the positions. Moving the lowest to the back and bring the highest in front. Which is a binary sort algorithm.
No. No. No. No. Changed my mind. Wanna come down. To see this tiny ad: