Back

#include<stdio.h>

void qsort(int v[], int left, int right);

int main()

{

  int i, v[]={9,5,8,12,56,7,1,19,27,99,27,13,3};

  for(i=0; i<13; i++) printf("  %d  ",v[i]);
  printf("\n");

  qsort(v,0,12);

  for(i=0; i<13; i++) printf("  %d  ",v[i]);
  printf("\n");

  return 0;
}


void qsort(int v[], int left, int right)
{
  int i, last;
  void swap(int v[], int i, int j);

  if(left >= right) return;
  swap(v, left, (left + right)/2);

  last = left;

  for(i=left+1; i<=right; i++)
   if(v[i] < v[left]) swap(v,++last, i);

  swap(v, left, last);
  qsort(v, left, last-1);
  qsort(v, last+1, right);

}


void swap(int v[], int i, int j)
 {
   int temp;

   temp = v[i];
   v[i] = v[j];
   v[j] = temp;
}

Top