快速排序其他实现代码

Posted on Edited on Word count in article: 480 Reading time ≈ 1 mins.
  1. int hoare_partition( int a[], int low, int high)
  2. {
  3. int x=a[low];
  4. int i=low-1;
  5. int j=high+1;
  6. while (1)
  7. {
  8. do {j–;}
  9. while (a[j]>x);
  10. do {i++;}
  11. while (a[i]<x);
  12. if (i<j)
  13. swap(a[i],a[j]);
  14. else return j;
  15. }
  16. }
    1. void hoare_quicksort( int a[], int low, int high)
  18. {
  19. int q;
  20. if (low<high)
  21. {
  22. q=hoare_partition(a,low,high);
  23. hoare_quicksort(a,low,q);
  24. hoare_quicksort(a,q+1,high);
  25. }
  26. }
      1. int _tmain( int argc, _TCHAR* argv[])
  28. {
  29. int a[9]={45,32,1,5,34,2,4,32,2};
  30. hoare_quicksort(a,0,8);
  31. for ( int i = 0; i< 9; i++)
  32. cout << a[i]<< " " ;
  33. return 0;
  34. }