Space

//比较大小static int compare_int(const void *int1,const void *int2){ if(*(const int*)int1>*(const int*)int2) { return 1; } else if(*(const int*)int1<*(const int*)int2) { return -1; } else {

//合并有序数组//合并例子void MemeryArray(int a[], int n, int b[],int m, int c[]){ int i,j,k; i=j=k=0; while(i<n && j<m) { if(a[i]<b[j]) { c[k++] = a[i++]; } else { c[k++]=b[j++]; }

void issort2(int a[],int n){ int temp=0; int i=0,j=0; for(i=1;i<n;i++) { temp=a[i]; j=i-1; while(j>=0 && a[j]>temp) { a[j+1]=a[j]; j--; } a[j+1]=temp; }}

//用于比较大小int compared(const void *key1,const void *key2){ cout<<"enter compare"<<endl; const int* iKey1 = (int*)key1; const int* iKey2 = (int*)key2; cout<<*iKey1<<endl; cout<<*iKey2<<endl; if(*

void quick_sort(int s[],int l,int r){ if(l<r) { int i=l,j=r,x=s[l]; while(i<j) { while( i= x) { j--; } if(i<j) { s[i++]=s[j]; } while(i<j && s[i]<x) { i++

#include #include using namespace std;int compared(const void *key1,const void *key2){ //cout<<"enter compare"<<endl; const int* iKey1 = (int*)key1; const int* iKey2 = (int*)key2; //cout<<*iK