Java code for fast sorting

Package src;

Public class QSort
{

/**
* @ Param args
*/
Public static void main (String [] args)
{
// TODO automatically generates method stubs
Quicksort qs = new quicksort ();
Int data [] = {44,22, 2,32, 54,22, 88,77, 99,11 };
Qs. data = data;
Qs. sort (0, qs. data. length-1 );
Qs. display ();
}

}

Class quicksort
{
Public int data [];

Private int partition (int sortArray [], int low, int hight)
{
Int key = sortArray [low];

While (low
{
While (low Hight --;
SortArray [low] = sortArray [hight];

While (low Low ++;
SortArray [hight] = sortArray [low];
}
SortArray [low] = key;
Return low;
}

Public void sort (int low, int hight)
{
If (low
{
Int result = partition (data, low, hight );
Sort (low, result-1 );
Sort (result + 1, hight );
}

}

Public void display ()
{
For (int I = 0; I <data. length; I ++)
{
System. out. print (data [I]);
System. out. print ("");
}
}
}