快速排序算法-轻微改动小应用

 

代码为：

#include "stdafx.h"#include <iostream>using namespace std;void Partition(int A[], int N, int V){int i = 0, j = N-1, temp = A[i];while( i < j){while( (A[j] <= V) && (i < j) ){j--;}A[i] = A[j];while( (A[i] >= V) && (i < j) ){i++;}A[j] = A[i];}A[i] = temp;}int main(){const int NN = 3;int a[NN],V;cout << "/n请输入数字:";for(int i = 0; i < NN; i++)cin >> a[i];cout << "/n请输入V值：";cin >> V;Partition(a, NN, V);cout << "/n处理之后的结果是：";for(int i = 0; i < NN; i++)cout << a[i] << " ";return 0;}