Array Sorting - Does anyone hava a decent JAVA method

1. pivot = list[sup];
2. i = inf;
3. j = sup - 1;
4. cont = 1;


5. if (inf >= sup)
6. return;


7. while (cont)
8. while (list[i] < pivot) { ++i; }
9. while (list[j] > pivot) { --j; }
10. if (list[i] > list[j])
11. temp = list[i];
12. list[i] = list[j];
13. list[j] = temp;
14. else
15. cont = 0;

16. temp = list[i];
17. list[i] = list[sup];
18. list[sup] = temp;


19. QuickSort (list, inf, i - 1);
20. QuickSort (list, i + 1, sup);

/**
*
* @author xboxrulz
* Source Code is released under CDDL if requested.
*
*/
import java.util.Arrays;
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        int intCount;
        String strNames[] = {"Gary", "Adrian", "Corey", "Alex", "Adrien", "Josh", "Zev"};
        for (intCount=0; intCount<=6;intCount++)
        {
            Arrays.sort(strNames);
            System.out.println("Hello\t" + strNames[intCount]);
        }
    }

}

public class SelectionSort
{
public static void main(String args[])
{

int array[] = new int[10];
for (int i=0; i < array.length; i++){
array[i] = (int)(java.lang.Math.random()*100);
}
selectionSort(array);

for (int i=0; i < array.length; i++){
System.out.println("Val of array[" + i + "] = " +array[i] );
}

}

public static void selectionSort(int arr[])
{
for (int i=0; i<arr.length; i++)
{
for (int j=i+1; j<arr.length-1; j++)
{

if(arr[i]>arr[j]){
int tmp =arr[j];
arr[i]=arr[j];
arr[j]=tmp;

}
}

}
}
}