duanbin的博客

#include #include #include #include #include #include #include "heap.h" // 这个文件是最小堆文件，链接：http://blog.youkuaiyun.com/qq_27396861/article/details/54382118 typedef struct mytimer_t {     int

#include #define heap_step 128 typedef struct _heap_t {     void** data;     int cap_size;     int size;     int (*compare)(void*, void*); }heap_t; static void heap_init(heap_t*

> 树和节点 typedef struct tree_node_t {     struct tree_node_t* left;     struct tree_node_t* right;     struct tree_node_t* parent;     int value; } tree_node_t; typedef struct tree_t

#include <stdio.h> void quick_sort(int* a, int left, int right) { if (NULL == a || left >= right) return; int i = left; int j = right; int key = a[left]; w...

1）先把数据堆化（把数据插入到最后，然后向上循环）  2）再在堆的基础上从上向下循环排序 #include void sort(int data[], int size) {     if (NULL == data)     {         return;     }     // 堆化     int i = 0;     for (i

目录一、代码二、结果 一、代码 #include <stdio.h> #include <string.h> int test() { const char* src = "BBCABCDABABCCDABCDABDEWWF"; const char* dst = "ABCDABD"; int srcLen = strl