关于qsort的解释看这里,只要待排序元素在内存中是连续的,并且类型一致,都可以使用qsort函数对其进行排序。
http://msdn.microsoft.com/en-us/library/aa272872(v=VS.60).aspx
qsort的内部实现是快速排序算法,为了比较几种算法的性能,自己写了三个与qsort接口一致的函数。
简单选择排序:
#include <malloc.h>
#include <memory.h>
void SelectSort(
void *base,
size_t num,
size_t width,
int (__cdecl *compare )(const void *, const void *)
)
{
size_t i = 0;
size_t j = 0;
size_t k = 0;
void *pTempValue = malloc(width);
for (i = 0; i < num; ++i)
{
k = i;
for (j = i + 1;j < num; ++j)
{
if(compare( (char *)base + k * width , (char *)base + j * width ) > 0 )
{
k = j;
}
}
if( k != i )
{
memcpy(pTempValue,(char *)base + i * width,width);
memcpy((char *)base + i * width, (char *)base + k * width, width);
memcpy((char *)base + k * width, pTempValue, width);
}
}
free(pTempValue);
}
冒泡排序:
#include <malloc.h>
#include <memory.h>
void BubbleSort(
void *base,
size_t num,
size_t width,
int (__cdecl *compare )(const void *, const void *)
)
{
size_t i = 0;
size_t j = 0;
void *pTempValue = malloc(width);
for (i = 0; i < num; ++i)
{
for (j = i + 1;j < num; ++j)
{
if(compare( (char *)base + i * width , (char *)base + j * width ) > 0 )
{
memcpy(pTempValue,(char *)base + i * width,width);
memcpy((char *)base + i * width, (char *)base + j * width, width);
memcpy((char *)base + j * width, pTempValue, width);
}
}
}
free(pTempValue);
}
希尔排序:
#include <malloc.h>
#include <memory.h>
void ShellSort(
void *base,
size_t num,
size_t width,
int (__cdecl *compare )(const void *, const void *)
)
{
size_t i = 0;
size_t j = 0;
size_t gap = 0;
void *pTempValue = malloc(width);
for (gap = num / 2; gap > 0; gap /= 2)
{
for (i = gap; i < num; i++)
{
memcpy(pTempValue,(char *)base + i * width, width);
for (j = i; j >= gap && (compare((char *)base + (j - gap) * width,pTempValue) > 0); j -= gap)
{
memcpy((char *)base + j * width, (char *)base + (j - gap) * width, width);
}
memcpy((char *)base + j * width, pTempValue, width);
}
}
free(pTempValue);
}
如果不知道怎么用,直接看这个链接吧……
http://msdn.microsoft.com/en-us/library/aa272872(v=VS.60).aspx