资源列表
sjjc
- 数据结构实践教程，里面有大量的数据结构的例子，包括详细的程序。-Data structure tutorial practice, which a large number of examples of data structures, including the detailed procedures.
paixusuanfa
- 本程序实现的算法：冒泡排序、shell排序、快速排序、归并排序 （1）设n个关键字均为整数(1≤n≤100000) （2）设计K个内部排序算法(K≥5), 每个算法须记录执行所需的时间 （3）自动生成多组数据,每组数据含n个整数(正序、逆序、随机分布) -This procedure implemented algorithms: bubble sort, shell sort, quick sort, merge sort (1) Let n keywords are int
zuiduanlujing
- 求一个有向图中的最短路径，给定一个源点求该点到其他点的最短路径-Seeking a directed graph of the shortest path, given a source point of seeking other points that point to the shortest path
x
- 《算法导论》 课后习题答案 只有部分习题有答案 英文-Introduction to Algorithms after-school Exercises Answer
lcis
- A Fast Algorithm for Computing a Longest Common Increasing Subsequence
listinarray
- 实现一个静态链表，静态链表是一种很高效的数据结构，同时具备链表和线性表的优点-To achieve a static list, static list is a very efficient data structure, at the same time have the advantages of linked lists and linear form
queuebystack
- 用栈实现队列，栈是自己写的，栈的方法都已封装好，这个练习是熟悉数据结构的使用、开拓思路用的-With the stack to achieve queue, stack their own writing, and stack methods have been packaged well, this exercise are familiar with the use of data structures, explore new ideas using
ackerman
- 试验Ackerman函数，并且带有对此算法的一些分析，以及和另外算法的比较-Ackerman function tests, and with some analysis of this algorithm, as well as a comparison with another algorithm
hanoi
- Hanoi塔的递归调用和消除尾递归的方法，附带算法的设计思路和分析-Hanoi Tower recursive calls and the elimination of tail recursion method with the algorithm design and analysis of ideas
aaa
- 根据《算法与数据结构》课程的结构体系，设计一个基于DOS菜单的应用程序。要利用多级菜单实现各种功能。比如，主界面是大项，诸如线性表、栈与队列、串与数组及广义表等，子菜单使这些大项中的一些功能或者小项。要求所有子菜单退出到他的父菜单。-According to " Algorithms and Data Structures" course of the structural system, design a menu-based DOS applications. To tak
astack
- 本人编写的来数组实现的堆栈，定义了很多操作，是本人学习数据结构的一点小结-a stack write by me
suanfashejixitidaan
- 算法设计与分析基础答案值得一看啊 下载最好-Algorithm Design and Analysis of the basis of answers to download the best worth seeing ah