摘要：
如题，为了以后找工作，开始勤奋写博客Mark一记作为分割线 阅读全文
摘要：
ordinary heap merge#include stdio.h#include stdlib.h#include time.h/*time functions library*/#ifndef _Heap_H#define Max_Size (100000)/*the array-size of heap*/#define K (100)/*merge K times*/#define Range (1000)/*the data X's range*/struct HeapStruct;typedef struct HeapStruct *PriorityQueue;ty 阅读全文
摘要：
#include stdio.hint table[1000];/*save the inputed hash table*/int indegree[1000];/*save every table-element's degree*/int list[1000];/*save the element's correct input order*/struct queuerecord{ int front; int rear; int buf[1000];};typedef struct queuerecord queue;queue q;/*define queue q*/void m 阅读全文
摘要：
四叉树法完成#include stdio.h#include stdlib.h#ifndef QuadTreetypedef struct quadtreenode *Quadtree;#endif#define MAX_SIZE (20000)struct quadtreenode{ int totalnum;/*the total population number in the area*/ Quadtree leftback; Quadtree leftfront; Quadtree rightback; Quadtree rightfront; int up,down,lef 阅读全文