数据结构与算法-快速排序

来源：互联网发布：量化策略就是数据挖掘编辑：程序博客网时间：2024/04/29 03:01

代码参照博客http://blog.csdn.net/feixiaoxing/article/details/6845132#userconsent#

#include <iostream>#include <stdio.h>#include <stdlib.h>using namespace std;int get_middle(int array[], int start, int end){int front = 0;int tail = end - start;int value = array[start];int length = end - start + 1;int loop = start + 1;int *gQuickSort;gQuickSort=(int*)malloc(sizeof(int)*length);while(loop <= end){if(array[loop] < value){gQuickSort[front] = array[loop];front ++;}else{gQuickSort[tail] = array[loop];tail --;}loop ++;}gQuickSort[front] = value;memmove(&array[start], gQuickSort, sizeof(int) * (length));return start + front ;}void _quick_sort(int array[], int start, int end){int middle;if(start >= end)return;middle = get_middle(array, start, end);_quick_sort(array, start, middle -1);_quick_sort(array, middle + 1, end);}void quick_sort(int array[], int length){int median = 0;if(NULL == array || 0 == length)return;_quick_sort(array, 0, length-1);}int main(){int array[10] = {1,5,3,2,7,8,6,10,9,4};  quick_sort(array, sizeof(array)/sizeof(int));  for (int i=0;i<10;i++){cout<<array[i]<<" ";}return 0;}

0 0