资源列表
shenduyouxiansousuoqiumigong
- 深度优先搜索求迷宫问题 采用深度优先搜索的方法求解迷宫问题，方便快捷-Depth-first search order to the maze problem using depth-first search method for solving a maze problem, convenient and quick
Cpp1
- 实验目的： 学习用指针构造链表，操作链表 实验内容： 输入两个非降序列，转换成两个非升序列，合并成一个非升序列。 基本要求： 用链表实现。 完成解题报告 -Experimental Objective: To study the list with a pointer structure, the operation contents of the list experiment: two non-reducing input sequence into a seq
qsort
- 本程序实现了快速排序的功能 在速度上有优化，界面简洁-sort function
Hanmin
- 汉明码，一个错误校验码码集。与其他的错误校验码类似，汉明码也利用了奇偶校验位的概念，通过在数据位后面增加一些比特，可以验证数据的有效性。利用一个以上的校验位，汉明码不仅可以验证数据是否有效，还能在数据出错的情况下指明错误位置。 -Hamming code, a checksum error code set. And other similar error checking code, Hamming code also makes use of the concept of parity, d
queue.c
- data structure-- implementing queue using c-data structure-- implementing queue using c...
shell
- 一个关于shell排序的代码，很实用，而且效率高。-A shell of the sort of code, very practical, and high efficiency.
Dijkstra
- 简单的Dijkstra算法实现，大家可以稍微-Implement of the Dijkstra algorithm.
C
- C语言实现的数据结构中二叉树的前序遍历、中序遍历和后序遍历以及几种排序算法-C language data structure binary tree before preorder, preorder and postorder and several sorting algorithm
trains_out
- 火车出站问题，一列有n节车厢的火车，每节车厢进站出站为先进后出的机制，求所有可能的车厢出站顺序-The train station problem, there is an n carriages of the train, each car is inbound outbound, last-out mechanism, to do everything possible car outbound order
binarytree
- 二叉树的排序！前序，中序及后序，并求其深度-Binary tree sort! Pre-order, middle order and post order, and to seek its depth
link_merge
- 单链表的应用，将两个有序链表的合并成一个有序链表。-Single-linked list application, the merger of the two sorted lists into a sorted list.
TEST
- 这个程序代码主要是体现了C++中++和--的自增自减的运算说明，我加了详细的注释，看完这个程序就基本可以了解C++中自增自减的相关用法-This mainly reflects the code C++,++ and- of self by self-descr iption by the operation, I added detailed notes, read the program can understand the basic C++, since the increased us