int partition (int arrNum [], int low, int high)
{
int pivot = arrNum [high];
int a = (low - 1); // smaller element index
for (int b = low; b <high; b ++)
{
// condition to check current element is smaller than or equal to pivot
if (arrNum [b] <= pivot)
{
a ++;
// swapping arrNum [a] and arrNum [b]
int temp = arrNum [a];
arrNum [a] = arrNum [b];
arrNum [b] = temp;
}
}
// swapping arrNum [a + 1] and arrNum [high]
int temp = arrNum [a + 1];
arrNum [a + 1] = arrNum [high];
arrNum [high] = temp;
return a + 1;
}
void sortNumber (int arr [], int low, int high)
{
if (low <high)
{
int part = partition (arr, low, high);
// Recursive function sort elements before partition and after partition
sortNumber (arr, low, part - 1);
sortNumber (arr, part + 1, high);
}
}
[/ CODE]
For more on sorting algorithms you can refer [URL = 'http: //www.flowerbrackets.com/how-to-implement-quick-sort-in-java-program/'] this [/ URL] resource.
