Easy way to check which player in array list is the highest?

I am wondering if there is an efficient way of checking which player is the highest up e.g. largest y value (furthest from the floor).

 

Code:java

Player highest = some player;// Initialize this somehow or you will get errors.
 
for(Player p : playerList) {
    if(p.getLocation().getY() > highest.getLocation().getY()) {
      highest = p;
    }
}

 

Thank you what about if I wanted to order the rest of the array list?
The only way I can think of doing it is actually removing the player who is heightest and carrying on checking the rest of the players

 

Well, in that case you have to take a different approach. The built in ArrayList sort will not use the criteria your want so your gonna have to pull out your advanced data structures book....

http://en.wikipedia.org/wiki/Bubble_sort

 

beanonaboard
Make a player variable called secondHighest (just like highest) and initialize it.

You will need to edit your for loop to work with two variables : highest player and second highest. (Note: this is in the case of 2 players you are looking for. The more you need, the more variables, the more complex it gets and there are probably better ways of doing this).

Code:java

Player highest = x;
Player secondHighest = y;
 
for (Player p : your list) {
if (p.getLocation().getY() < highest.getLocation().getY() && p.getLocation().getY() > secondHighest.getLocation().getY()) {
secondHighest = p;
}
 
if (p.getLocation().getY() > highest.getLocation()) {
highest = p;
}
}

 

Alshain01 Oh please, a bubble sort is by far one of, if not the worst ways to sort a data structure.

beanonaboard Look up LinkedLists, stacks, queues, BST's, etc for storing information in order. This makes retrieving the top value MUCH faster. If you're dealing with a lot of players, I'd recommend writing your own class to handle forming an innumerable BST and a few methods to handle searching. That is, if you want scalability and efficiency.

 

It's not the worst. You could be using Bogosort. Or Randall Munroe's FastBogosort.

 

Oh, no I recommended the Bubble Sort for it's ease. It's inefficient but easy to understand. Efficiency won't matter on player list anyway. Takes at least 10000 elements to make a noticeable difference.

 

What's wrong with Collections.sort();?

 

Don't throw that out there without sending them to a comparator document, lol
http://docs.oracle.com/javase/7/docs/api/java/util/Comparator.html