白痴

#include <stdio.h>#include <stdlib.h>#include <memory.h>#include "stack.h"#ifdef __cplusplus extern "C" { #endif #ifdef STACK_LINKtypedef struct stack{ int num;...

#include <stdlib.h>#include <memory.h>#include "queue.h"#ifdef __cplusplusextern "C"{#endif#ifdef QUEUE_LINKtypedef struct queue{ int num; struct queue *next;}QUEU...

 /* insertion-sort */int insertion_sort(int* arr, unsigned int arrCount){ unsigned int iLoop = 0; unsigned int jLoop = 0; int numInsert = 0; if(arr == NULL) { return -1; } for(...

没想到第二个就是个费劲的，最怕递归，加油！ #include "sorts.h"#include <malloc.h>#include <stdlib.h>#include <memory.h>static void merge(int * arr, unsigned int p, unsigned int q, unsigned r...

今天是我最熟悉的冒泡法。。int bubble_sort(int * arr, unsigned int arrLength){ unsigned int iLoop = 0; unsigned int jLoop = 0; int tempChange = 0; if(arr == NULL) { return -1; } for(iLoop =...

今天学堆排序了，好长，没学完，所以充数一下，把第一天写的插入排序，写了一个通用版本，这个版本抽象成排序类型、类型大小比较、移动类型三种操作。从而理论上可以对任何数组进行排序（我考虑可以对结构体、字符串等，需要抽象成指针），权当练习吧。typedef int (*COMPARE_KEYS)(const SORT_TYPE key1, const SORT_TYPE key2);type...

static void max_heapify(int * arr, unsigned int beginPos, unsigned int length){ unsigned int largest = 0; unsigned int left = 0; unsigned int right = 0; unsigned int tempPos = 0; int te...