快速排序算法 代码(C)

本文地址: http://blog.csdn.net/caroline_wendy

经典的快速排序算法, 作为一个编程者, 任何时候都要完整的手写.

代码:

/*
 * main.cpp
 *
 *  Created on: 2014.6.12
 *      Author: Spike
 */

/*eclipse cdt, gcc 4.8.1*/

#include <stdio.h>
#include <stdlib.h>

int RandomInRange(int min, int max)
{
    int random = rand() % (max - min + 1) + min;
    return random;
}

void Swap(int* num1, int* num2)
{
    int temp = *num1;
    *num1 = *num2;
    *num2 = temp;
}

int Partition(int data[], int length, int start, int end)
{
    if(data =http://www.mamicode.com/= NULL || length <= 0 || start < 0 || end >= length) {>
输出:
13 27 38 49 49 65 76 97