paixu.h

实现了插入排序

class paixu
{
public:
    double compare;  //元素比较次数
    double move;     //元素移动次数
    double exchange; //元素交换次数
	double time;
	void insertsort(int r[],long m,long n);
    void shellsort(int r[],long m,long n);
    void bubblesort(int r[],long m,long n);
    void quicksort(int r[],long s,long t);
	void selectsort(int r[],long m,long n);
    void heapsort(int r[],long n);
    void sortmerge(int a[],long p1,long p2,int b[]);
protected:
	clock_t start,end;   //时钟参量
	void quick(int r[],long s,long t);
	void sift(int r[],long l,long m);
	void merge(int a[],long s,long m,long n,int b[]);
	void mmergesort(int a[],long p1,long p2,long len,int b[]);
};