快速排序（数组传递有问题）

为什么80%的码农都做不了架构师？>>>   

  思路：在数组中选择一个数字，然后把数组中的数字分为两个部分，比选择小的数字在数组左边，比选择大的数字在数组右边。然后递归进行这样的操作。

#include<iostream>
#include<cstdio>
#include<cstdlib>
using namespace std;

int RandomInRange(int start, int end)
{
    int range = end - start + 1;
    int val = rand() % range + start;
}

void swap(int* p, int* q)
{
    int temp;
    temp = *p;
    *p = *q;
    *q = temp;
}

int Partition(int data[], int length, int start, int end)
{
    if (data == NULL || length <= 0 || start < 0 || end >= length)
    {
        cout << "无效输入" << endl;
        return 0;
    }

    int index = RandomInRange(start, end); //随机选一个数
    swap(&data[index], &data[end]);

    int small = start - 1;
    for (index = start; index < end; ++index)
    {
        if (data[index] < data[end])
        {
            ++small;
            if (small != index)
            {
                swap(&data[index], &data[small]);
            }
        }
    }

    ++small;
    swap(&data[small], &data[end]);
    return small;
}

void QuickSort(int data[], int length, int start, int end)
{
    if (start == end)
    {
        return;
    }

    int index = Partition(data, length, start, end);
    if (index > start)
    {
        QuickSort(data, length, start, index - 1);
    }
    if (index < end)
    {
        QuickSort(data, length, index + 1, end);
    }

    cout << data << endl;
}

int main()
{
    int a[5] = {5, 4, 1, 7, 9};
    QuickSort(a, 6, 1, 5);

    return 0;
}

 

转载于:https://my.oschina.net/134596/blog/1791666