资源列表
Desktop
- 快速排序算法，数据结构中的一种排序算法，快速排序算法(Fast sorting algorithm)
list and sequence table
- 链表和顺序表的基本操作，简单易懂，简洁明了(The basic operation of the list and the sequence table.)
dijkstra算法的最短路径
- 最短路径，可以求解图论中的两点间最短路径。程序可用。可实现效果很好(The shortest path can solve the shortest path between two points in graph theory. The program is available. The effect is very good.)
数据结构作业2
- 很好的解决力随机排序，银行模拟等等等等等国内刚刚那个不能给你你就(vskalcnladmzlsX>dmL:AXm.kd:XLdmiowxpqxjDNCKZLIPPQCiomsx;lAD<x;zd)
findM
- 利用深度优先遍历的思想从指定节点出发，寻找长度为M的所有简单路径(Using the idea of depth first traversal, starting from the specified nodes, we look for all simple paths of length M.)
图的最短路径之迪杰斯特拉和弗洛伊德算法
- 数据解构中的经典算法，图的最短路径算法之迪杰斯特拉和弗洛伊德的C++实现(Classic algorithms in data deconstruction, Dijkstra's and Floyd's C++ implementation of the shortest path algorithm of graphs)
单链表
- 单链表，增删查改 单链表，实现了删除，插入，遍历等功能(Single linked list, delete, insert, traversal and other functions.)
Bitree
- 二叉树是一种非常重要的数据结构,很多其他数据机构都是基于二叉树的基础演变过来的。(The two fork tree is a very important data structure. Many other data organizations are based on the basis of the two fork tree.)
20180429
- 斗地主加入14种牌型识别并可出四三二一牌型源码(The landlords add 14 types of cards and identify 4321 cards)
DSinfixtopostfix
- 简单的中缀表达式转后缀表达式并求值的程序。支持加减乘除。内置说明。(A simple program that converts infix expression to postfix, and calculates the postfix expression. Symbol + - * / = ( ) supported.)
text encryption
- 对一个文本串以事先给出的字母映射进行加密，未映射的字符不改变。(A text string is encrypted by the alphabetic map given in advance, and the characters that are not mapped remain unchanged.)
seg_tree
- segment tree 的简要实现，主要是面对与搜索的数据结构(Let us consider the following problem to understand Segment Trees. We have an array arr[0 . . . n-1]. We should be able to 1 Find the sum of elements from index l to r where 0 <= l <= r <= n-1 2 Change