c++实现八大排序方法（一）

1、直接插入排序

#include<iostream>
using namespace std;
int main()
{
int a[10] = { 23, 4, 5, 66, 12, 3, 9, 777, 56, 1 };
int m,i,j;
for (i = 1; i < 10; i++)
{
m = a[i];
for (j = i - 1; a[j] > m&&j >= 0; --j)
a[j + 1] = a[j];
a[j + 1] = m;
}
for (i = 0; i < 10; i++)
cout << a[i] << " ";
return 0;

}

2、希尔排序

（一趟希尔排序）

#include<iostream>
using namespace std;
int main()
{
int a[10] = { 23, 4, 5, 66, 12, 3, 9, 777, 56, 1 };
int i, j, k = 5, m;
for (i = k; i < 10; i++)
{
m = a[i];


for (j = i - k; j >= 0 && a[j] > m; j -= k)
a[j + k] = a[j];
a[j + k] = m;

}
for (i = 0; i < 10; i++)
cout << a[i] << " ";
return 0;
}

3、选择排序

#include<iostream>
using namespace std;
int main()
{
int a[10] = { 23, 4, 5, 66, 12, 3, 9, 777, 56, 1 };
int i, j, m,n;
for (i = 0; i < 10; i++)
{
int k;
n = a[i];
m = a[i];
for (j = i+1; j < 10; j++)
{
if (a[j] < m)
{
m = a[j];
k = j;
}
}
a[i] = m;
a[k] = n;
}
for (i = 0; i < 10; i++)
cout << a[i] << " ";
return 0;
}

4、快速排序

#include<iostream>
using namespace std;
int sort(int b[], int m, int n)
{
if (m < n)
{
int i = m, j = n, k = b[m];
while (i < j)
{
while (i<j&&b[j]>k)
j--;
b[i] = b[j];
i++;
while (i < j&&b[i] < k)
i++;
b[j] = b[i];
j--;
}
b[i] = k;
sort(b, 0, i - 1);
sort(b, i + 1, n);
}
return 0;
}
int main()
{
int a[] = { 23, 4, 5, 66, 12, 3, 9, 777, 56, 1 };
int len = sizeof(a) / sizeof(a[0]);
sort(a, 0, len - 1);
for (int i = 0; i < len; i++)
cout << a[i] << " ";
}