插入排序

#include <iostream>using namespace std;const int SIZE=50;int main(){   int no,i,j;int arr[SIZE];cin>>no;    for(i=0;i<no;i++)   cin>>arr[i];for(i=1;i<no;i++){   if(arr[i]<arr[i-1])   {      int temp=arr[i];  for(j=i-1;j>=0;j--)  {     if(arr[j]>temp) arr[j+1]=arr[j]; else break;  }  arr[j+1]=temp;   }}    for(i=1;i<no;i++)cout<<arr[i]<<" ";cout<<endl;    return 0;}

void sort(int* a, int n){int j;for(int i=1; i<n; i++){int t = a[i];for(j=i;j>0&&t<a[j-1];j--)a[j]=a[j-1];a[j] = t;}}

#include <iostream>using namespace std;#include <ctime>void sort(int* a, int n);int main(){const int N=10240;int a[N];for(int i=0; i<N; i++)a[i] = N-i;for(int i=0; i<10; i++)cout << a[i] << ' ';cout << endl;clock_t t1 = clock();sort(a,N);clock_t t2 = clock();cout << double(t2-t1)/CLOCKS_PER_SEC << endl;for(int i=0; i<10; i++)cout << a[i] << ' ';cout << endl;}