资源列表
O(logN)sort
- 时间复杂度为O（logN）的排序算法。。俗称重口味排序-Time complexity is O (logN) sorting algorithm. . Commonly known as the flavors sort
TrainArrangeApp
- 用C#语言实现数据结构堆栈，并用该堆栈应用在火车车厢重排问题中-With the C# language data structure stack, and stack application with the rearrangement in the train car in question
playMax
- 用回溯法和递归调用的思想实现了多边形游戏算法，用codeblocks开发。输入多边形的N个定点的数值和N条边的运算符，可计算任意断开一条边后计算所得的最大值。-Backtracking and recursive calls with the idea to achieve a polygon game algorithm, using codeblocks development. Input polygon fixed values of N and N edge
BA-BBV-code
- 小世界 bbv网络生成仿真软件 可以模拟两个网络的演化-Generate small-world bbv network simulation software can simulate the evolution of the two networks
heapsort
- 本程序限定产生16个1-100之间的不重复的随机数，统计排序过程中的元素比较次数-The program generates 16 1-100 limit between non-repeating random numbers, statistical elements in the process of sorting the number of comparisons
LabB
- （1）如果用循环链表表示一元多项式，试编写一个函数 Calc(x)，计算多项式在x处的值。 （2）设a和b是两个用带有表头结点的循环链表表示的多项式。试编写一个算法，计算这两个多项式的乘积c = a*b，要求计算后多项式a与b保持原状。 -( 1) if the circular linked list representation of a polynomial, try to write a function Calc ( x ), a polynomial in x value a
Greed
- 利用贪心算法解决“部分背包问题”。这是个经典算法，实现的也比较完善，易用而且BUG少。-This code is about the "Knapsack problem".Our policy is the "Greedy Algorithm".It s easy to use & has nearly no BUG.
CProgram
- 用C语言实现的关于栈、文件、排序、缓存区等的功能模拟。-Implemented in C on the stack, file, sort, cache and other analog functions.
KMP
- KMP算法，有好几种写法，配上图形，简单易懂。C/C++编写。-KMP algorithm, there are several writing, accompanied by graphics, easy to understand. C/C++ written.
paixu2.8
- 快速排序算法 按第一个元素排列或按随机元素排列 算法分析与设计-Quick sort algorithm or by the first element of array elements arranged in random
YSF_Head
- 这是带头结点的循环链表实现的约瑟夫环程序。-This is a circular linked list of nodes to take the lead implementation of Josephus program.
rat_in_maze
- 基于栈数据结构的迷宫老鼠问题C语言求解，在VS2010下编写并测试通过-C language to solve maze mouse problem based on a stack data structure