6中简单的排序算法分析

#include<iostream.h>
#include<stdlib.h>
const int N=20;
int compcount; 
int movecount;

void Beforesort()
{
compcount=0;
movecount=0;
}

void output(int table[],int n) 
{
cout<<" table: ";
for(int i=0;i<n;i++)    
cout<<table[i]<<" ";
cout<<endl;
}

void swap(int table[],int i, int j)   
{
int temp=table[i];
table[i]=table[j];
table[j]=temp;
}

void print()   
{
cout<<"compcount= "<<compcount<<endl;

cout<<"movecount= "<<movecount<<endl<<endl;
}

void insertsort(int table[],int n)  
{
Beforesort();
cout<<"直接插入排序: \n";
for(int i=0;i<n;i++)
{
compcount++;
int m=table[i];
movecount=1;
int j=0;
while(j<i && m>=table[j])
j++;
    
cout<<"j="<<j ;
for(int h=i-1;h>=j;h--)
{
          table[h+1]=table[h];
  movecount+=3;
}
table[j]=m;
//movecount+=1;
cout<<"movecount"<<movecount;
output(table,n);
}
print();
}