资源列表
distance
- 求平面求百万点的最小距离， 求平面求百万点的最小距离 求平面求百万点的最小距离-distance of point
Learn
- 归并排序(链表实现) 基数排序(LSD) 基数排序(MSD) -Merge sort (linked list implementation) radix sort (LSD) radix sort (MSD)
Apriori
- 频繁模式挖掘Apriori算法 其中的.dat文件为样例数据, 具体使用方法参见main.c-Frequent Pattern Mining Apriori Algorithm
Project-Diva
- 课程作业, 分别实现链表的合并与纯化, 线性表的逆置等功能-Course work, respectively, to achieve the list of mergers and purification, the linear form of the inverse function set
Project-Diva-3
- 实现并比较快速排序, 选择排序, 冒泡排序, 插入排序, 归并排序, 堆排序等排序算法-Realization and compare quick sort, selection sort, bubble sort, insertion sort, merge sort, heap sort, such as sorting algorithm
Project-Diva-4
- 课程作业, 将输入的前缀表达式转换为对应的逆波兰表达式(后缀表达式)-Course work, the prefix expression is converted to the corresponding input Reverse Polish Notation (postfix expression)
Project-Diva-5
- 先实现了将前缀表达式转换为逆波兰表达式的功能, 之后再利用逆波兰表达式对表达式进行求值, 支持+,-,*,/,^等运算, 以及sqrt, lg, ln, exp, sin, cos, tan, asin, acos, atan, sh, ch等函数操作-First realized the prefix expressions into reverse Polish notation features, re-use reverse Polish expression after the exp
maze
- 迷宫求解一般采用“穷举法”，逐一沿顺时针方向查找相邻块（一共四块－东(右)、南(下)，西(左)、北(上)）是否可通，即该相邻块既是通道块，且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。-Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four-
Merge-sort
- 归并排序是建立在归并操作上的一种有效的排序算法。-Merge sort is based on the operation of an efficient merge sort algorithm.
SOJKHFFX
- 数据结构的简单应用、队列和表的简单增删改查-Simple deletions simple application data structures, queues, and tables to the investigation
HString
- 自己编写的字符串处理处理,实现string内的几个函数-I have written string handling processing, several functions within a string
datastruct
- 现在有一个英文字典,单词量很大，达到100多万的单词，而且还有很多重复的单词。 单词（词组）检索,字符串哈希，hash散列算法,Trie树结构-Now there is an English dictionary, the word is large, reaching more than 100 million words, but there are many duplicate words. Word (phrase) search, string hash, hash hash al