xier.cpp

来自「一个简单排序算法 1023实现希尔排序」· C++ 代码 · 共 48 行

//#include <stdafx.h>
#include<stdio.h>
#define LEN 8
int array[LEN] = {45,23,55,1,32,3,56,10};

void outputList()
{ 
 for(int i=0;i<LEN;++i)
 {
  printf("%d ",array[i]);
 }
 printf("\n");
}

int partition(int low, int high) 
{
 int tmp = array[low];
 int pivotkey = array[low];
 while (low < high) 
 {
  while (low < high && array[high] >= pivotkey) --high;
  array[low] = array[high];
  while (low < high && array[low] <= pivotkey) ++low;
  array[high] = array[low];
 }
    array[low] = tmp;
 return low;
}

void qSort(int low,int high)
{
 if (low < high) 
 {
  int pivotloc = partition(low, high);
  qSort(low, pivotloc - 1);
  qSort(pivotloc + 1, high);
 }    
}

void main()
{
 printf("The data before sort : \n");
 outputList();
 qSort(0,LEN-1);
 printf("The data after sort : \n");
 outputList();
}