Quick sort ascending/descending

public String[] quickSort(String[] record, int begin, int end, Collator Collator)
{
    String[] tempek = new String[1];
    int i = begin;
    int j = end;
    String mid;

    if (end > begin) 
    {
	// Arbitrarily establishing partition element as the midpoint of the array.
	mid = record[(begin + end) / 2];

        // loop through the array until indices cross
        while (i <= j) 
	{
	    // find the first element that is greater than or equal to the partition element starting from the left Index.
	    while ((i < end) && (Collator.compare(record[i], mid) < 0)) // maybe here for descending? but it doesn't work :(
	    { i++; }
	    	
	    // find an element that is smaller than or equal to the partition element starting from the right Index.
	    while ((j > begin) && (Collator.compare(record[j], mid) > 0)) // maybe here for descending? but it doesn't work :(
	    { j--; }

	    // if the indexes have not crossed, swap
	    if (i <= j) 
	    {
	     	tempek[0] = record[j];
	       	record[j] = record[i];
	       	record[i] = tempek[0];

	       	i++;
	       	j--;
	    }
	}

	// If the right index has not reached the left side of array must now sort the left partition.
	if (begin < j)  quickSort(record, begin, j, Collator);

	// If the left index has not reached the right side of array must now sort the right partition.
	if (i < end)    quickSort(record, i, end, Collator);
    }
	
    return record_delo;
}

import java.text.Collator;
import java.text.RuleBasedCollator;
import java.util.Locale;


public class blbl {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		String[] b2 = {"aaa","addd","aff", "afde" , "aabe" , "aaee" , "aeef" ,"agge", "aa","a"};
		
		 RuleBasedCollator en_USCollator = (RuleBasedCollator)
	     Collator.getInstance(new Locale("en", "US", ""));

		String[] o = blbl.quickSort(b2, 0,b2.length-1,Collator.getInstance());
		
		for (int i = 0; i < o.length; i++) {	
			System.out.println(o[i]);	
		}
	}

	public static String[] quickSort(String[] record, int begin, int end, Collator Collator)
	{
	    String[] tempek = new String[1];
	    int i = begin;
	    int j = end;
	    String mid;

	    if (end > begin) 
	    {
		// Arbitrarily establishing partition element as the midpoint of the array.

		mid = record[(begin + end) / 2];

	        // loop through the array until indices cross

	        while (i <= j) 
		{
		    // find the first element that is greater than or equal to the partition element starting from the left Index.

		    while ((i < end) && (Collator.compare(record[i], mid) > 0)) // maybe here for descending? but it doesn't work :(

		    { i++; }
		    	
		    // find an element that is smaller than or equal to the partition element starting from the right Index.

		    while ((j > begin) && (Collator.compare(record[j], mid) < 0)) // maybe here for descending? but it doesn't work :(

		    { j--; }

		    // if the indexes have not crossed, swap

		    if (i <= j) 
		    {
		     	tempek[0] = record[j];
		       	record[j] = record[i];
		       	record[i] = tempek[0];

		       	i++;
		       	j--;
		    }
		}

		// If the right index has not reached the left side of array must now sort the left partition.

		if (begin < j)  quickSort(record, begin, j, Collator);

		// If the left index has not reached the right side of array must now sort the right partition.

		if (i < end)    quickSort(record, i, end, Collator);
	    }
		
	    return record;
	}
}