排序算法

A[i]=array[i];
cout<<"原始数据为："<<endl;
for(int a=1;a<=count;a++)
cout<<A[a]<<" ";
cout<<endl<<"冒泡排序过程如下："<<endl;
int k=1,exchanged;
do
{
exchanged=0;
{
A[0]=A[k];
A[k]=A[k-d];
A[k-d]=A[0];
}
}
}
}
for(int t=1;t<=count;t++)
cout<<A[t]<<" ";
cout<<endl;
d=d/2;
cout<<A[k]<<" ";
cout<<endl;
}
cout<<endl;
return;
}
void Sort::Shell(char*F)
{
put_in(F);
if(count==0)
{
cout<<"Enter Numbers!"<<endl;
A_count++;
}
if(A[j-1]<array[i])
{
A[j]=array[i];
A_count++;
break;
}
else
A[j]=A[j-1];
}
for(int k=1;k<=A_count;k++)
void Quick(char*);
void partition(int*,int,int,int&);
void quick(int*,int,int);
void Select(char*);
private:
int count;
int array[M];
};
cout<<"原始数据为："<<endl;
for(int j=1;j<=count;j++)
cout<<A[j]<<" ";
cout<<endl;
cout<<"选择排序过程如下："<<endl;
for(int I=1;I<count;I++)
{
A[0]=A[I];
return;
}
int A[M];
for(int i=1;i<=count;i++)
A[i]=array[i];
cout<<"原始数据为："<<endl;
for(int ห้องสมุดไป่ตู้=1;a<=count;a++)
cout<<A[a]<<" ";
cout<<endl<<"希尔排序过程如下："<<endl;
Sort::Sort()
{
count=0;
}
Sort::~Sort(){}
void Sort::put_in(char*F)
{
ifstream infile(F,ios::in);
if(!infile)
{
cout<<"Open Error!"<<endl;
return;
cout<<A[a]<<" ";
cout<<endl;
}
return;
}
int main()
{
Sort sort1,sort2,sort3,sort4,sort5;
sort1.Bubble("data.txt");
cout<<endl;
sort2.Insertation("data.txt");
cout<<endl<<"快速排序过程如下："<<endl;
quick(A,s,t);
return;
}
void Sort::Select(char*F)
{
put_in(F);
int A[M];
for(int k=1;k<=count;k++)
A[k]=array[k];
}
return;
}
void Sort::Bubble(char*F)
{
put_in(F);
if(count==0)
{
cout<<"Enter Numbers!"<<endl;
return;
}
int A[M];
for(int i=1;i<=count;i++)
int d=count/2;
while(d>=1)
{
for(int i=1;i<=d;i++)
{
for(int j=i+d;j<=count;j=j+d)
{
for(int k=j;k>i;k=k-d)
{
if(A[k]<A[k-d])
cout<<endl<<"插入排序过程如下："<<endl;
A[1]=array[1];
cout<<A[1]<<endl;
for(int i=2;i<=count;i++)
{
for(int j=i;j>=0;j--)
{
if(j==0)
{
A[1]=array[i];
cout<<endl;
sort3.Quick("data.txt");
cout<<endl;
sort4.Select("data.txt");
cout<<endl;
sort5.Shell("data.txt");
return 0;
}
"data.txt"文件中的内容：
59 20 45 3 18 73 37 22 81 104 65 0
***********以下是数据结构中所有的排序算法，C++语言编写，可复制到cpp文件中直接运行***********
# include<iostream>
# include<fstream>
int i=s,j=t;
while(i!=j)
{
while(i<j && A[j]>A[0])
j--;
if(i<j)
{
A[i]=A[j];
i++;
}
while(i<j && A[i]<A[0])
i++;
if(i<j)
{
using namespace std;
const int M=50;
class Sort
{
public:
Sort();
~Sort();
void put_in(char*);
void Insertation(char*);
void Shell(char*);
void Bubble(char*);
cout<<A[t]<<" ";
cout<<endl;
}
while(k<=count && exchanged==1);
return;
}
void Sort::partition(int A[],int s,int t,int& cutpoint)
{
A[0]=A[s];
cout<<A[k]<<" ";
cout<<endl;
quick(A,s,i-1);
quick(A,i+1,t);
}
}
void Sort::Quick(char*F)
{
put_in(F);
if(count==0)
{
cout<<"Enter Numbers!"<<endl;
return;
}
int A[M],s=1,t=count;
for(int i=1;i<=count;i++)
A[i]=array[i];
cout<<"原始数据为："<<endl;