How can I sort parallel arrays?

I devised an algorithm that will sort parallel arrays using the Array.Sort method. It copies the main array to a duplicate, which is sorted, and compares it to the original. The sort order is then saved to a new array, which is used for displaying the sorted array together with the matching data. Here is the code: =============================================== using System; namespace ParallelSort_CS { class Class1 { static void Main(string[] args) { int x, y; string[] nom = {"Tom", "Sue", "Bill", "Joe", "Betty", "Fred"}; int[] grd = {56, 78, 90, 82, 65, 89}; string[] newnom = new string[6]; int[] sortlist = new int[6]; Console.WriteLine("Unsorted list of students and their grades:\n"); for (x = 0; x <= 5; x++) Console.WriteLine("#{0}: {1} - {2}.", x + 1, nom[x], grd[x]); Array.Copy(nom, newnom, 6); Array.Sort(newnom); for (x = 0; x <= 5; x++) { for (y = 0; y <= 5; y++) if (nom[y] == newnom[x]) sortlist[x] = y; } Console.WriteLine(); Console.WriteLine("Sorted alphabetical list by name with grades:\n"); for (x = 0; x <= 5; x++) Console.WriteLine("#{0}: {1} - {2}.", x + 1, newnom[x], grd[sortlist[x]]); Console.WriteLine(); } } } ============================================== However, I would also like to do the same using a bubble sort, but C# can't use the < or > operators to compare strings. Coming from VB6 with no experience in OOP, how can I implement the CompareTo method? I would like to keep it as simple as possible. The following is the bubble sort program that gives an error: ============================================= using System; namespace ParallelBubble_CS { class Class1 { static void Main(string[] args) { int x, j, k, tempgrd; string tempnom, first, second; string[] nom = {"", "Tom", "Sue", "Bill", "Joe", "Betty", "Fred"}; int[] grd = {0, 56, 78, 90, 82, 65, 89}; Console.WriteLine("Unsorted list of six students and their grades:\n"); for (x = 1; x <= 6; x++) Console.WriteLine("#{0}: {1} - {2}.", x, nom[x], grd[x]); for (j = 1; j <= 6; j++) { for (k = 1; k <= 5; k++) { first = (nom[k]); second = (nom[k+1]); if (first > second) { tempnom = nom[k]; tempgrd = grd[k]; nom[k] = nom[k + 1]; grd[k] = grd[k + 1]; nom[k + 1] = tempnom; grd[k + 1] = tempgrd; } } } Console.WriteLine("\nSorted alphabetical list by name with grades:\n"); for (x = 1; x <= 6; x++) Console.WriteLine("#{0}: {1} - {2}.", x, nom[x], grd[x]); Console.WriteLine(); } } }