数据结构重温
snailbreak
这个作者很懒,什么都没留下…
展开
-
排序之冒泡排序
void bubble(char *items, int count)...{ register int i, j; register char t; for(i = 1; i count; ++i) for( j = count-1; j >= i; --j) ...{ if(items[j - 1] > items[ j ]) ...{ /**//*原创 2006-10-20 12:00:00 · 668 阅读 · 0 评论 -
排序之快速排序
void QuickSort(char *items, int count)...{ qs(items, 0, count-1);}/**//* The Quicksort. */void qs(char *items, int left, int right)...{ register int i, j; char x, y; i = left; j = right; x = it原创 2006-10-20 12:08:00 · 669 阅读 · 0 评论 -
排序之插入排序
void insert(char *items, int count) ...{ register int a, b; char t; for(a=1; a count; ++a) ...{ t = items[a]; for(b=a-1; (b >= 0) && (t items[b]); b--) items[b+1] = items[b]; item原创 2006-10-20 12:01:00 · 618 阅读 · 0 评论