所有排序算法

#include<iostream>
#include<stack>
using namespace std;
int a[] = {1,9,2,4,3 };


void my_print(int a[5])
{
for (int i = 0; i < 5; i++)
{
cout << a[i] << " ";
}
cout << endl;
}
//插入排序算法
void insert(int a[5],int len)
{
int i = 1;

for (int i = 1; i < len; i++)
{
int key = a[i];
int index = i - 1;
while (key<a[index])
{
if (index == 0)
break;
a[index + 1] = a[index];
index--;
}
a[index+1] = key;


}
my_print(a);
}
//交换排序算法
void exchange(int a[5],int len)
{
int i = 0, j = 0;
for (i = 0; i < len - 1; i++)
{
int k = i;
while (a[k] > a[k + 1]&&k<len-1)
{
int temp = a[k];
a[k] = a[k + 1];
a[k + 1] = temp;
k++;
}
}
my_print(a);
}
void select(int a[5], int len)
{
int i = 0, j;
for (i = 0; i < len; i++)
{
int min = a[i ];
int index_min = i;
for (j = i + 1; j < len; j++)
{
if (a[j] < min)
{ 
min = a[j];
index_min = j;
}
}

a[index_min] = a[i];
a[i] = min;
}
my_print(a);
}
void combine(int a[5],int b[5],int left,int mid,int right)
{
cout << "left:" << left <<"mid:"<<mid<< "right:" << right << endl;
int i = left,j=mid+1;
int k = left;
while (i <= mid&&j <= right)
{
if (a[i] < a[j])
{
b[k] = a[i];
i++;
}
else {
b[k] = a[j];
j++;
}


k++;
}
while (i != mid + 1)
b[k++] = a[i++];
while (j != right + 1)
b[k++] = a[j++];
for (i = left; i <= right; i++)
a[i] = b[i];
}
void combine_sort(int a[5],int b[5],int left,int right)
{
if(left<right)
{ 
   int mid = (left + right) / 2;
combine_sort(a, b, left, mid);
combine_sort(a, b, mid + 1, right);
   combine(a, b, left, mid, right);
}
}
void quicksort(int a[5],int left,int right)
{
int key = a[left];
cout << "key:" << key << endl;
int i = left;
int j = right;
while (i < j)
{
while (i<j&&a[j]>key)
{
j--;
}
a[i] = a[j];
while (i <j&&a[i] < key)
{
i++;
}
a[j] = a[i];
}
a[i] = key;
if(left<i-1)
quicksort(a, left, i-1);
if(i+1<right)
quicksort(a, i + 1, right);

}
//快速排序的非递归
void stack_quicksort(int a[5], int left, int right)
{
stack<int> stack;
stack.push(left);
stack.push(right);
while (stack.empty()== false)
{
int r = stack.top();
stack.pop();
int l = stack.top();
stack.pop();
int key = a[l];
int i = l;
int j = r;
while (i < j)
{
while (i<j&&a[j]>key)
{
j--;
}
a[i] = a[j];
while (i <j&&a[i] < key)
{
i++;
}
a[j] = a[i];
}
a[i] = key;

if (l< i - 1)
{
stack.push(l);
stack.push(i - 1);
}
if (i + 1<r)
{ 
stack.push(i + 1);
stack.push(r);
}


}


}




void adjust(int a[5],int k,int len)
{
int temp = a[k];
cout << "temp:" << a[k] << endl;
int i = 0;
bool is = false;
while( (i = (2 * k))  <=len)
{
if (i+1 <=len&&a[i + 1] < a[i])
{
i++;
}
if (a[i] > temp)
{
is = true;
break;
}
a[k] = a[i];
k = i;
}
if (!is)
a[i/2] = temp;


}


void adjust2(int a[5], int k, int len)
{
int min = k;
int left = k * 2;
int right = k * 2 + 1;
if (left <= len&&a[left] < a[min])
{
min = left;
}
if (right <= len&&a[right] < a[min])
{
min = right;
}
if(a[min]<a[k])
{ 
   int temp = a[k];
   a[k] = a[min];
   a[min] = temp;
   adjust2(a, min, len);
}


}
void heap(int a[5],int len)
{
for (int i = len / 2; i >= 1; i--)
{
adjust2(a, i, len );
}

cout << a[1] << endl;
for (int j = len ; j > 1; j--)
{
a[1] = a[j];
cout << "a[j]:" << a[j] << endl;
adjust2(a,1, j);
cout << a[1] << endl;
}
cout << a[1] << endl;
}
int main()
{
//insert(a,5);
//exchange(a, 5);
//  select(a, 5);
//int b[5] ;
//combine_sort(a, b, 0, 4);
//quicksort(a, 0, 4);
//stack_quicksort(a, 0, 4);
//my_print(a);
heap(a, 4);
return 0;
}