资源列表
ChessBoard
- 用4种不同形态的L型骨牌覆盖一个给定的特殊棋盘上除特殊方格以外的所有方格，且任何2个L型骨牌不得重又能叠覆盖。-In four different forms of L-type domino covering a given special special squares on the board in addition to all other boxes, and any two L-shaped dominoes can not be re-stacked coverage.
yiyuanxishuduoxiangshi
- 这是一个一元稀疏多项式计算器 能够实现多项式的输出 降幂 还有加法 减法 乘法功能 除此之外还有能够对不同阶数的线性方程组求解 对于无解时会提醒。此程序供大家参考。-This is a one yuan sparse polynomial calculator can realize the output power and down polynomial function besides addition and subtraction method to different order nu
LeafNodes
- 假设二叉树用二叉链表表示。写一个算法，计算二叉树中的叶结点数目。要求不使用全局变量。-This is the main project file for VC++ projects generated using an Application Wizard. It contains information about the version of Visual C++ that generated the file, and information about the p
MergeSort
- 自己实现的c++归并排序算法 已验证准确性-merge sort algorithms in c++
data-structure
- 描述了基本的数据结构算法：例如单链表的线性表、多项式等的建立遍历-Describes the basic data structure algorithms: for example, a linear single-chain form, through the establishment of such polynomials, etc.
The-code
- 严蔚敏《数据结构与算法》的书上习题以及例题源代码！-The answers of <<Data structure and algorithms>>
hangbanguanli
- 数据结构课程设计C++语言，应用了MFC库，图形界面编写的小型航班管理系统，数据结构采用文件读写方式，包括查询，订票，退票3个基本功能。 内有程序设计报告-Data Structures C++ language curriculum design, the application of the MFC library, a graphical interface written in small flight management systems, data structures used
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