Sort GameObject Array according to Int Array Values[SOLVED]

[bkups2003]

Hello,

I have 2 arrays. Player Names (strings), and Player Scores (ints). How can i Sort BOTH arrays according to the ints in just the second array.

Here is an example:

(BEFORE)
Array 1          Array 2
Bob                50
Jack                10
Terry               25
Mike                5

I want the result:

(AFTER)
Array 1          Array 2
Bob                50
Terry               25
Jack                10
Mike                5

edit: Made it easier to understand. Changed example.

[jeanfabre]

Hi,

 For this you need a third temporary array that will sort the indexes the way you want.

 Typically, if you want to sort by score, duplicate the score array, sort it, and look up the scores in that sorted array and use this index, to then find the unsorted ones, and finally get the player name.

so:

(UNCHANGED)
Array 1          Array 2
Bob                50
Jack                10
Terry               25
Mike                5

( TEMP SORTED )
                   50
                   25
                   10
                    5

now, let's say you want to know the second best score:

1: get the second item in TEMP SORTED, it's 25
2: in "array 2", find the index of 25, it's 2 ( array indexes starts at 0)
3: in "array 1", get the player name at index it's "TERRY"

Does that make sense?

bye,

 Jean

[bkups2003]

Oh yes, i Ended up doing something very similar except with a hash table and an array list.

Score int-> string
Added the score as the key to the Hash Table with the value as the Players Name
Keys -> Array (hash table keys action)
Sort
get 0/1/2 array value for 1st, 2nd, 3rd
hash table get that key.

What do you think? They are really doing the same thing, actually. Just The hash table has the keys which remove the need for the third array. Would their be any benefit over this way or over the way you mentioned in any way at all? Optimization or problems that may occur?

From what i can tell, there is a small problem apparent in both methods where if 2 players have the same score, it may find the same player twice...

[jeanfabre]

Hi,

Both solutions are ok.

to lift the duplicate problem, simply use your temporary as a pool you delete used items from. So everytime you pick an index, you delete it, and therefore if you have two duplicates, you will process them, because the first one is not there anymore.

bye,

 Jean

[devnoir]

hello all,

i know this topic's old, but im a bit confused here.

once the arraylist has been sorted, which hashtable action is used to retrieve the keys?

im stuck on this part:

"hash table get that key."

Thanks!

[djaydino]

Hi,
Check out tutorial 6 here or here with a sample file

[devnoir]

@djaydino - thank you