资源列表
testSortings
- 编写选择排序、插入排序、冒泡排序、快速排序、堆排序、希尔排序、归并排序、基数排序算法，加上C++库函数sort，调用系统时钟clock对排序算法做效率比较。-Write selection sort, insertion sort, bubble sort, quick sort, heap sort, Hill sort, merge sort, radix sort algorithm, plus C++ library function sort, calling the system c
Josephus
- 约瑟夫问题，输入总人数n，输入每隔m个人出列一个，按出列顺序输出每人的原始序号。-Joseph problems, enter the total number n, m input every individual out of a column, press the column order number of the original output per person.
SHUJU-
- 数据结构课件，每章内容都有，值得学习和借鉴-Data structure courseware, detailed content of each chapter, it is worth learning and reference
calcmulate-0
- 给定一个整数N,求N的阶乘末尾有多少个0 应用程序的每个文件的内容。-Given an integer N, N factorial seeking the end there is the content of the application number 0 for each file.
graph--matrix
- 采用邻接矩阵来实现图的创建， graph.cpp是主应用程序源文件-Implementation creates graph adjacency matrix
Binary-Tree
- （1）从键盘上输入数据，建立二叉链表。 （2）前序遍历、中序遍历、后序遍历二叉树：递归算法。 （3）前序遍历、中序遍历、后序遍历二叉树：非递归算法。 （4）借助队列实现二叉树的层次遍历。 在主函数中设计一个简单的菜单，分别调试上述算法。-(1) input data the keyboard, build binary list. (2) former preorder, preorder, after preorder binary tree: recursive al
main
- 计算闭包完全最短路径，可自由输入闭包的顶点个数-fLOYD，Calculate the complete shortest path path, the number of vertices of the free input closure
Knap
- 背包问题的模板程序，可适应不同数据类型,使用了模板类-Template program knapsack problem can be adapted to different types of data, using a template class
Chinas-postal-problem
- 计算机离散数学-图论-中的中国邮路问题的一种解决方案，可在dev，VC下调试成功-Computer discrete mathematics- China postal problem in graph theory, a solution, can be in dev, VC debugging success
aly
- 写出将一个无向图的邻接矩阵转换成邻接表的算法-Write an undirected graph adjacency matrix algorithm converts adjacency list
als
- 每30个旅客同乘一条船将全船一半的旅客投入海中，30个人围成一圈，由第一个人数起，依次报数，数到第9人，便把他投入大海中 然后再从他的下一个人数起，数到第9人，再将他扔进大海中。如此循环地进行，直到剩下15个乘客为止。问哪些位置是将是被扔下大海的位置。-Each 30 passenger ride with a boat to ship half of the passengers into the sea, 30 people form a circle, starting the
A-topological-sort-of-directed-graph
- 数据结构中的有向图的拓扑排序算法基础程序，可在此基础上进行更改，主要构造了无向图、有向图和逆邻接图，使用c语言编程。-Data structure topological sort algorithm of the directed graph based program that can be changed, on the basis of the main structure undirected graph and directed graph and inverse adjacency