#include <stdio.h>
#include <stdlib.h>
#include <string>
struct node
{
int key;
int data;
};
bool InsertSort(void* data,size_t size,size_t esize,int (*compare)(void* key1,void* key2))
{
char* a = (char*)data;
char* key = NULL;
key = (char*)malloc(esize);
if(NULL == key || size == 1)
{
return false;
}
for (int i = 1;i < size; ++i)
{
::memcpy((void*)key,(void*)&a[i*esize],esize);
int j = 0;
for(;j <= i - 1; ++j)
{
if (compare((void*)&a[j*esize],(void*)key) > 0)
{
break;
}
}
if (j <= i - 1)
{
for (int k = i - 1;k >= j; --k)
{
::memcpy((void*)&a[(k+1)*esize],(void*)&a[k*esize],esize);
}
// 3 5 7 2
::memcpy((void*)&a[j*esize],(void*)key,esize);
}
}
free(key);
return true;
}
int compare1(void* k1 ,void* k2)
{
int key1 = *(int*)k1;
int key2 = *(int*)k2;
if (key1 > key2)
{
return 1;
}
else if(key1 == key2)
{
return 0;
}
else
{
return -1;
}
}
int compare2(void* key1,void* key2)
{
node* pNode1 = static_cast<node*>(key1);
node* pNode2 = static_cast<node*>(key2);
if (pNode1->key > pNode2->key)
{
return 1;
}
else if(pNode1->key == pNode2->key)
{
return 0;
}
else
{
return -1;
}
}
int main()
{
/* int ary[6] = {5,3,7,2,6,0};
InsertSort((void*)ary,6,sizeof(int),compare1);
for (int i = 0;i < 6; ++i)
{
printf("%d ",ary[i]);
}
printf("\n");
*/
node ary[6] = {{5,5},{3,3},{7,7},{2,2},{6,6},{0,0}};
InsertSort((void*)ary,6,sizeof(node),compare2);
for (int i = 0;i < 6; ++i)
{
printf("%d ",ary[i].data);
}
printf("\n");
return 1;
}