快速排序算法中的partition函数的应用

#include<iostream>
#include<fstream>
using namespace std;

//根据已经给出位置的基准数来对数组进行排序
void partition_pos(int arr[], int left, int right, int pos);
//给出相应的值来确定位置，并根据它来进行排序
void partition_value(int arr[], int left, int right, int value);

int returnPos(int arr[], int length, int value);

int main(int argc, char argv[])
{
	ifstream cin("test.txt");
	int arr[10];
	for (int i = 0; i < 10; i++)
		cin >> arr[i];
	cin.close();
	partition_pos(arr, 0, 9, 5);
	//partition_value(arr, 0, 9, 5);
	ofstream cout("test.txt", ios::app);
	cout << endl;
	//cout << "partition_value:";
	cout << "partition_pos:";
	for (int i = 0; i < 10; i++)
		cout << arr[i] << " ";
	cout.close();
	return 0;
}

void partition_pos(int arr[], int left, int right, int pos)
{
	int pivot = arr[pos];
	//将left位置上的数据放到pos位置上去(该做法是为了执行顺序能够是的该树足的全部数据都参与比较)
	//可以出去它本身,即left=left+1;
	arr[pos] = arr[left];
	
	while (left < right)
	{
		while (left < right&&arr[right] > pivot)
			right--;
		arr[left] = arr[right];
		while (left < right&&arr[left] < pivot)
			left++;
		arr[right] = arr[left];
	}
	arr[left] = pivot;
}

void partition_value(int arr[], int left, int right, int value)
{
	int pos = returnPos(arr, 10, value);
	if (pos == -1)
	{
		cout << "没有给出的数据" << endl;
		return;
	}
	int pivot = arr[pos];
	arr[pos] = arr[left];
	while (left < right)
	{
		while (left<right&&arr[right]>pivot)
			right--;
		arr[left] = arr[right];
		while (left < right&&arr[left] < pivot)
			left++;
		arr[right] = arr[left];
	}
	arr[left] = pivot;
}

int returnPos(int arr[],int length, int value)
{
	for (auto i = 0; i < length; i++)
	{
		if (arr[i] == value)
			return i;
	}
	return -1;
}