快速排序算法实现（算法记录一）

最新推荐文章于 2024-09-22 00:03:19 发布

小溪塔

最新推荐文章于 2024-09-22 00:03:19 发布

阅读量106

点赞数

分类专栏： c++ 文章标签：排序算法

本文链接：https://blog.csdn.net/weixin_44039187/article/details/110135632

版权

c++ 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

#include<iostream>
using namespace std;
typedef int TElemType;

TElemType a[10] = { 30,80,90,20,50,60,15,89,79,24 };
void swap(int* ar, int low, int high)
{
 int temp;
 temp = ar[low];
 ar[low] = ar[high];
 ar[high] = temp;
}
int QGetValid(int* ar, int low, int high)
{
 int Qvaild;
 int Key = ar[low];
 while (low < high)
 {
  while(low < high && Key <= ar[high])
   high--;
  swap(ar, low, high);
  while (low < high && Key >= ar[low])
   low++;
  swap(ar, low, high);
 }
 return low;

}

void Qsort(int* ar, int low, int high)
{
 int Qvaild;
 if (low < high)
 {
  Qvaild = QGetValid(ar, low, high);//取中间位置
  Qsort(ar,low,Qvaild-1);
  Qsort(ar, Qvaild+1, high);
 }

}
void QuickSort(int* ar, int low, int high)
{
 Qsort(ar, low, high);//排序算法
}
int main()
{
 QuickSort(a, 0, 9);
 for (int i = 0; i <10; ++i)
 {
  cout << a[i] << endl;
 }
 return 0;
}