/**
*
*/
package com.me.shuai;
/**
* @author Administrator
*
*/
public class testing {
/**
*
*/
public testing() {
// TODO Auto-generated constructor stub
}
/**
* @param args
*/
public static void main(String[] args) {
int[] testingValue = { 10, 2,2,13, 3, 4, 5, 8, 6, 7, 23,10, 20, 15, 50, 51 };
quickSort(testingValue, 0, testingValue.length - 1);
}
static void printCurrentStatus(int[] arr) {
System.out.println("begin");
for (int i : arr) {
System.out.print(i + " ");
}
System.out.println("the end");
}
static void quickSort(int[] arr, int low, int high) {
if (low > high)
return;
int result = 0;
result = Partition2(arr, low, high);
printCurrentStatus(arr);
quickSort(arr, low, result - 1);
quickSort(arr, result + 1, high);
}
static int Partition2(int[] arr, int low, int high) {
int piviot = arr[low];
while(low < high){
while(low < high && arr[high] >= piviot){ high--;}
{
int temp = arr[low];
arr[low] = arr[high];
arr[high] = temp;
}
while(low < high && arr[low] <= piviot){ low++;}
{
int temp = arr[low];
arr[low] = arr[high];
arr[high] = temp;
}
}
return low;
}
static int Partition3(int[] arr, int low, int high) {
int piviot = arr[low];
while(low < high){
while(low < high && arr[high] >= piviot){ high--;}
{
arr[low] = arr[high];
}
while(low < high && arr[low] <= piviot){ low++;}
{
arr[low] = arr[high];
}
}
arr[low] = piviot;
return low;
}
static int Partition(int[] arr, int low, int high) {
int sartPiviotIndex = low;
int piviot = arr[sartPiviotIndex];
while (true) {
for (; low <= high; --high) {
if (arr[high] <= piviot) {
break;
}
}
if (low > high) {
arr[sartPiviotIndex] = arr[low - 1];
arr[low - 1] = piviot;
return low - 1;
}
for (; low <= high; ++low) {
if (arr[low] > piviot) {
break;
}
}
if (low > high) {
arr[sartPiviotIndex] = arr[low - 1];
arr[low - 1] = piviot;
return low - 1;
}
int temp = arr[low];
arr[low] = arr[high];
arr[high] = temp;
if (low == high - 1) {
arr[sartPiviotIndex] = arr[low];
arr[low] = piviot;
return low;
}
low++;
high--;
}
}
}