main.cpp

这是快速排序的源代码

#include "select.h"
#include <iostream>
using namespace std;
void main()
{
	cout<<"请输入要进行快速排序的数字:"<<endl;
	int array[NUM];
    for(int i=0;i<NUM;i++)
		cin>>array[i];
	IndirectList<int>L(NUM);
	cout<<"快速排序结果:"<<endl;
	L.select(array,0,NUM-1);
	for(int m=0;m<NUM;m++)
		L.Insert(m,array[m]);
	while(1)
	{
	cout<<"请输入要进行二分查找的数字:"<<endl;
	int number;
	cin>>number;
	int result=L.BinarySearch(array,number,NUM);
	if(result==-1)
	{
		cout<<"线性表为:";
		for(int p=0;p<NUM;p++)
			cout<<array[p]<<" ";
		cout<<endl;
		cout<<"查找次数为:"<<L.index-1<<endl;
		cout<<"未查到"<<endl;
		L.index=0;
	}
	else
	{
		cout<<"线性表为:";
		for(int q=0;q<NUM;q++)
			cout<<array[q]<<" ";
		cout<<endl;
        if(L.index==1)
		{
		cout<<"查找次数为:"<<L.index<<endl;
	    cout<<"查到了"<<" "<<"它在数组中的第"<<result<<"位"<<endl;
	   	L.index=0;
		}
		else
		{
			cout<<"查找次数为:"<<L.index-1<<endl;
	        cout<<"查到了"<<" "<<"它在数组中的第"<<result<<"位"<<endl;
	   	    L.index=0;
		}
		
	}
	}
	
	

	
}