Basic high score table

Hey guys, I'm trying to recreate the classic game Minesweeper in Java for an assignment. At the moment I'm not planning on making a GUI, I just want to output into the command prompt. The game plays through perfectly so far; at the moment I'm up to creating a high score table, displaying a list of the five best completion times along with the names of the players who achieved them. I was able to get the times to display correctly using a basic array sort but I couldn't figure out how to get the names to change positions along with the scores.

Thus I am attempting a different method of sorting the high scores but so far, it isn't outputting correctly. Here is the method so far:

Code:

---

public void addEasyHighScore(String playerName)
{               
        for (int i = 4; i >= 0; i--)
        {
                if (scoresTableEasy[i] > completionTime)
                {
                        if (i > 0)
                        {
                                scoresTableEasy[i] = completionTime;
                                scoresTableEasy[i] = scoresTableEasy[(i - 1)];
                               
                        }
                       
                        if (i == 0)
                        {
                                scoresTableEasy[i] = completionTime;
                        }
                }
               
        }
}

---

completionTime is a float which holds the player's time taken from the most recent game.

playerName is input just before calling the Method.

scoresTableEasy is a float array which holds the score times.
I also have an String array namesTableEasy instantiated to hold the scorers' names.

It puts the first two scores in correctly but it fails to correctly insert scores that are in between two existing ones.

Sooooo can anyone give me some hints as to where I'm going wrong or what alternative methods I could use to complete this task? I'm not after full solutions, just a nudge in the right direction.

I'd go with a object oriented aproach here:

Code:

---

public class HighScore implements Comparable<HighScore> {
  private String name;
  private float completionTime;

  public HighScore(String n, float c) {
    name = n;
    completionTime = c;
  }

  public int compareTo(HighScore h) {
    if(completionTime < h.completionTime) return -1;
    if(completionTime > h.completionTime) return 1;
    return 0;
  }

  public String toString() {
    return name+" time taken: "+completionTime;
  }
}

---

Then you can do the sorting of HighScore objects using the compareTo method, and not having to worry about names while switching values.

Quote:

---

scoresTableEasy[i] = completionTime;
scoresTableEasy[i] = scoresTableEasy[(i - 1)];

---

The first line saves a value at [i] and then the second line replaces it with the value from [i-1] ???

Quote:

---

Originally Posted by Norm

The first line saves a value at [i] and then the second line replaces it with the value from [i-1] ???

---

I realise that was kind of dopey now that I look at it.

@m00nchile: That looks like it might be a good approach. So I should create an array of High Score objects and then compareTo each one with a for loop whenever a new high score is added?

EDIT: I forgot to mention that I need to do this all within the one class, can I just use those methods without making a new class?

You can always make HighScore an inner class, if you must have your whole program in one class:

Code:

---

public class Game {
  private class HighScore {
    //constructors, methods, etc.
  }
  //constructors, methods, etc.
}

---

Thanks but I've managed to solve the problem now. I appreciate your help.