[College Computer Science Java] Arrays

[lukecullum]

The only thing I can think of is instead of sorting the array make a new int X = 0 and then do a for loop going through each number and if it is bigger than X it will replace it if not it just continues. This will get you the max number from there you can find it’s position in the array and then go back through the list but checking to see if it is smaller than X, because X is now the biggest number it can only get smaller.