资源列表
Archive
- binaryNode 和 binarysearchtree 是实现了一个二叉树。arrayvector是自己实现的vector。binary search 是一个二元搜索方法。 single list是自己实现的一个单向链表。findthemajority是寻找数组中主元素的一个算法。list是用数组实现的一个链表。permute是一个实现全排列的算法。-binaryNode and binarysearchtree is the realization of a binary tree. ar
Source-code
- DATA STRUCTURE BST STACK QUEUE AVL TREE HEAPSORT-DATA STRUCTURE BST STACK QUEUE AVL TREE HEAPSORT
C-Program
- 雅克比过关法算法求矩阵的奇异值分解，是雅克比算法的优化，提高计算速度-Jacobian immigration law algorithms singular value decomposition of a matrix, Jacobi algorithm optimization, improve computing speed
1
- 1.能输入包括空格的任意字符串，长度不限； 2.统计26个英文字母的使用频率； 3.按使用字母频率由大到小，输出字母极其频率。 -Can enter any string, including spaces, the length is not limited 2. Statistical frequency of use of the 26 letters of the alphabet 3. Descending frequency by using the alphabet
the_k_shortest_path
- 第k短路算法，用A*算法和优先队列实现。查找任意两点间的第k短路，时间复杂度O(NLOGN)-K-shortest path algorithm, A* algorithm and priority queue. Find the first k short circuit between any two points, the time complexity of O (NLOGN)
r141
- codeforces r141 题目A, 算法，编程，ACM，coding-codeforces r141 Problem A
sort
- 快速排序 排序中的性能很好但是不稳定的算法，时间复杂度为nLogN-Quicksort sort performance is good but unstable algorithm time complexity is nLogN
Greedy-algorithm
- 贪心算法，具体的讲解了贪心算法，代码非常规范，是学习数据结构和算法难得的资料-Greedy algorithm, specific explanation of the greedy algorithm, the code is very standard, learning data structures and algorithms rare information
Apriori-
- 自我实现的一个Apriori算法，用于小规模固定数据，实现从数据源中提取频繁项集和产生关联规则-A self-fulfilling Apriori algorithm for small-scale fixed data, frequent itemsets extracted from the data source and associated rules
yuandaima
- 有关C语言的数据结构的各种算法包括栈，链表，二叉树-Various algorithms of the C language data structures including stacks, linked lists, binary trees, etc.
Expression
- 表达式求值，先输入需要计算表达式的个数，再逐个写出表达式-Program design require for a function, can complete randomly input an expression (including parentheses, digital, arithmetic symbol), and be able to according to your input expression to evaluated, and come to the corre
Introduction-to-Algorithms
- 麻省理工学院使用的算法笔记，是学习《算法导论》的辅助资料-The MIT algorithm notes, learning the " Introduction to Algorithms" auxiliary information