资源列表
jisuandiguicishu
- 该程序主要功能是计算程序中递归算法的次数，可以用来判断递归算法的效率-The main function of the program is to calculate the number of recursive algorithm, can be used to judge the efficiency of recursive algorithm
shuangxianglianbiao
- 该程序主要练习了数据结构中双向链表的一些基本操作，可以用来熟悉双向链表的操作-The program is mainly practiced in the data structure of some of the basic operation of two-way linked list, can be used to familiar with the operation of two-way linked list
partition-package
- 采用贪心算法来解决部分背包问题，简化了动态规划思想，提高了算法效率-Use the greedy algorithm to solve some of the knapsack problem, simplify the dynamic programming, improving the efficiency of the algorithm
taskschedule
- 采用贪心算法中的拟阵思想来解决cpu进程调度问题，最小化惩罚-Use greedy algorithm to solve Matroid thought process cpu scheduling problem, minimize punishment
Kuruskal_Minispining_tree
- 最小生成树Kruskal算法的实现，采用openGL显示界面，支持顶点数量设置，以及位置移动，边的权值可自行设置，界面右侧分两个版图，上方是原图，下方为算法运行过程图-Implement Kruskal minimum spanning tree algorithm, using openGL display interface, support for setting the number of vertices, and the location of the mobile, edge we
data-structure
- 一份数据结构课程的课件，内容详细，初学者可以看懂，希望大家多多留意-A data structure curriculum courseware, detailed and beginners can understand, I hope a lot of attention
Demo1
- 双向链表的应用 26个英文字母 任意输入一个整数，能够实现以下功能：例如输入3, 输出结果为：DEFGHJKLMNOPQRSTUVWXYZABC-Two-way chain table 26 English letters of the application of arbitrary input an integer, can achieve the following functions: 3 such as input, The output is: DEFGHJKLMNOPQRS
Demo
- 数据结构中堆排序的代码实现。堆排序就是首先建立一个小顶堆或是大顶堆，然后把堆中最大的放到数组最后，再建立堆，再放到数组后面的位置-Data structure in the heap sort code. Heap sort is to first establish a small cap pile or pile top, and then put the heap s largest array in the end, to build pile, put them behind the
Demo
- 数据结构中快速排序的代码实现。快速排序的平均时间复杂度为 log2n,-Data structure in the quick sort code. The average time complexity of the quick sort log2n,
Demo
- 有关进制转换的代码实现。此代码能实现任意十进制、二进制、八进制的转换-The hexadecimal conversion code implementation. This code can realize arbitrary binary, octal, decimal and transformation
Demo
- 数据结构中的希尔排序算法。希尔排序算法是直接插入排序算法改进，时间复杂度降低了。-Hill sorting algorithms in data structure. Hill sorting algorithm is direct insertion sort algorithm is improved, and reduces the time complexity.
paixusuanfa
- 我自己写的一个关于数据结构中各种内部排序的时间复杂度的分析代码。里面有如何具体的实现，随机产生数组函数，还有对界面也略加设计。感觉对初学数据结构算法的人有一点帮助。-I write about a data structure in the analysis of time complexity in various internal sorting code. There are how to specific implementation, random array function, it