Sort key value pair by ordered array of keys

[Jacob Fenwick]

I have an unsorted, two dimensional array that contains a key value pair. I also have a sorted one dimensional array that contains the keys in their order. Like so:

class Test {
public static void main(String[] args) {
String[][] unsorted = { {"2", "the"}, {"3", "foo"}, {"1","in"}, {"4", "bar"} };
String[] sorted = { "1", "2", "3", "4" };
}
}

Now, the ordering in the sorted array is probably NOT a natural ordering.
I want to sort the unsorted 2d array based on the sorted 1d
array.
Is there a way built into java to do this? I'm researching using a Collection with a Comparator. I'm not knowledgable enough to immediately have a solution, perhaps someone else has dealt with this before?

[Keith Lynn]

It might be easier if you use a HashMap.

[Jacob Fenwick]

That's true, I suppose I should have explained it in terms of a hashmap to cut down on wording.

A more clear question is: Is there a way to get an ordered entrySet from a hashmap, where the ordering is based on some non-natural ordering of the keySet?
[ October 12, 2006: Message edited by: Jacob Fenwick ]

[Jacob Fenwick]

Nevermind, someone figured it out... If it's in a hashmap, and I have the list of ids, just loop through the list of ids and use those to pull the correct value out of the hashmap.

[Keith Lynn]

I believe you should be able to do that by creating a Comparator whose type is the type of the keys.