九种排序算法——冒泡排序(稳定)
#include<iostream>
#include <cstring>
using namespace std;
void ShellSort(int A[],int n) {
int i,j;
for(i=0;i<n;i++)
{
for (j=0;j<n-i-1;j++)
{
if(A[j]>A[j+1]) {
int temp = A[j];
A[j] = A[j + 1];
A[j + 1] = temp;
}
}
for (int k=0;k<n;k++)
{
cout<< A[k]<< " ";
}
cout <<endl;
}
}
int main()
{
int a[]={0,15,36,11,8,25,35,19,99,107,14,92}; //数组从第二位开始记录
ShellSort(a,12);
}