1.插入排序
#include<iostream>
using namespace std;
int main ()
{
int i,j,k=1,a,n,m,number[100];
cout<<"please enter a number as n:\n";
cin>>n;
cout<<"please input n interge numbers :\n";
for(m=1;m<=n;m++)
{
cin>>number[m];
}
for(i=2;i<=n;i++)
{
a=number[i];
j=i-1;
while(j>0 && number[j]>a)
{
number[j+1]=number[j];
j=j-1;
}
number[j+1]=a;
}
cout<<"排序后的数组:";
for(k=1;k<=n;k++)
{
cout<<number[k]<<" ";
}
return 0;
}
#include <stdio.h>
#include <math.h>
#define MAX 100
void swap(int*a,int*b)
{
int temp;
temp=*a;
*a=*b;
*b=temp;
}
void sort(int s[], int n)
{
int i, j, min, temp;
for (i = 0; i < n - 1; i++){
min = i;
for (j = i + 1; j < n; j++)
if (s[j] < s[min])
min = j;
sw