资源列表
软件基础实验
- 关于数据结构课程实验内容及相应C语言代码(About data structure course experiment content and corresponding C language code)
magic_square
- 创建魔方阵，通过输入m来控制它的阶数。m为小于100的奇数。(Create magic square by entering the m to control its order. M is an odd number less than 100.)
exp6
- 对一段文本构造哈夫曼树，对所有字符根据其权值编码。对每个结点的左分支编码为0，右分支编码为1。(Constructs a Huffman tree for a text, encodes all characters according to their weights. The left branch of each node is encoded at 0 and the right branch is encoded at 1.)
exp10
- 三种排序算法的C语言实现 直接插入排序算法。 快速排序算法。 直接选择排序算法。(Implementation of three sorting algorithms in C language Direct insertion sort algorithm. Quick sort algorithm. Direct selection sorting algorithm.)
exp9
- 有512人参与游戏，从1至512给每人分配一个编号，已知每个人的游戏得分在0～999之间，需要找出游戏参与者的最高分和次高分。让电脑自行产生512个随机整数给各位参与者得分。输出所有参与者及其得分。用顺序查找方法，锦标赛法、通过无序序列建堆和堆调整三种方法取得最高分者和次高分者及其分数并输出。(There are 512 people involved in the game, each assigned a number from 1 to 512, known to each player'
exp2
- 设有n个人围成一个圈，分别为他们起名为1,2，…… n，指定一个数m，从第一个人开始报数，报到m时，报m的人出圈，再从他的下一个人重新开始报数，报到m时，报m的出圈，如此下去，直到所有人都出圈为止。当任意给定n和m后，设计算法求n个人出圈的次序。(There are n individuals surrounded by a circle, respectively, they named 1,2,...... N, specify a number of M, from the first p
表达式求值和任务调度
- 实现多功能的表达式求值计算，以及任务调度模拟(Implementation of multi-function expression evaluation calculation, as well as task scheduling simulation)
约瑟夫环
- 约瑟夫环问题求解，c++原码，数据结构与算法解答(Joseph ring problem solving)
魔方阵
- 魔方阵问题解答，使用c++，源代码，数据结构与算法(Cube matrix problem, using c++, source code, data structures and algorithms)
Huf
- 哈夫曼树的实现，哈夫曼编码解码，c++源码，数据结构与算法(Huffman tree implementation, Huffman coding and decoding, c++ source code, data structures and algorithms)
修道士与野人
- 修道士与野人问题解答，c++原码，数据结构与算法(Repair solutions, Taoist and savage c++ original code, data structure and algorithm)
mydijkstra
- 迪杰斯特拉算法又称最小路径算法，是图论里的一种基础算法。这里实现一种较为简洁的最小路径算法。(Dijkstra algorithm, also known as the minimum path algorithm, is a basic algorithm in graph theory. Here to achieve a more concise minimum path algorithm.)