/*******************************************************************
Copyright(c) 2016, Harry He
All rights reserved.
*******************************************************************/
// 作者:TyroneLi
//
#include <iostream>
#include <cstdio>
int partition(int arr[], int low, int high)
{
if(arr == nullptr || low < 0 || high < 0 || low > high)
{
std::cout << "error in partition func." << std::endl;
exit(1);
}
int pivot = *(arr + low);
while(low < high)
{
while(low < high && *(arr + high) >= pivot) --high;
*(arr + low) = *(arr + high);
while(low < high && *(arr + low) <= pivot) ++ low;
*(arr + high) = *(arr + low);
}
*(arr + low) = pivot;
return low;
}
void quickSort(int arr[], int low, int high)
{
// if(arr == nullptr || low < 0 || high < 0 || low > high)
// {
// std::cout << "Empty array, error!" << std::endl;
// exit(1);
// }
if(low < high)
{
int pivot = partition(arr, low, high);
quickSort(arr, low, pivot-1);
quickSort(arr, pivot+1, high);
}
}
void test_1()
{
int arr[] = {2, 5, 1, 8, 29, 0, -9, -8};
for(auto e : arr)
std::cout << e << " ";
std::cout << std::endl;
quickSort(arr, 0, 7);
for(auto e : arr)
std::cout << e << " ";
std::cout << std::endl;
}
void test_2()
{
int arr[] = {-2, -1, 0, 1, 2, 3, 4, 5};
for(auto e : arr)
std::cout << e << " ";
std::cout << std::endl;
quickSort(arr, 0, 7);
for(auto e : arr)
std::cout << e << " ";
std::cout << std::endl;
}
void test_3()
{
int arr[] = {5, 4, 3, 2, 1, 0, -1, -2};
for(auto e : arr)
std::cout << e << " ";
std::cout << std::endl;
quickSort(arr, 0, 7);
for(auto e : arr)
std::cout << e << " ";
std::cout << std::endl;
}
void test_quickSort()
{
test_1();
test_2();
test_3();
}
int main(int argc, char**argv)
{
test_quickSort();
return 0;
}