资源列表
python_Class.py
- python 类例程，人、学生、老师以及异常的简单运用(Python class routines, people, students, teachers, and unusual simple use)
Single_LinkedList.py
- python的链表操作、单链表、循环链表、双向链表、带尾指针的链表以及链表排序等基本操作(Python linked list operations, single chain table, circular chain list, two-way chain list, with the tail pointer of the chain list, and chain sorting and other basic operations)
约瑟夫环
- 数据结构描述，使用C++编写约瑟夫环，实现约瑟夫环的排序等功能(Data structure descr iption, the use of C++ write Joseph ring,)
LinkedList
- 数据结构中的链表，采用了一种比较基础的写法，易懂(Data structure in the list, using a relatively basic style of writing, easy to understand)
ND
- 用牛顿法求方程的一个根 方程的表达式：f 区间的左端点：a 区间的右端点;b 根的精度：eps 求得的根：root(Using Newton method to find a root of equation)
PAT全套答案_1001至1049
- 该文档包含了PAT上的基础部分案例，可以参考一下(The document contains the basic part of the PAT case, you can refer to)
华为OJ平台题目源码平台题目源码
- 本文档包含华为OJ平台部分题目及源码，供刚入职同事及在校学生练习！！！
算法导论答案
- 麻省理工大学算法导论答案详解，有助于学习算法导论的同学们。(Massachusetts Institute of Technology Introduction to the introduction of the algorithm, help to learn the introduction of algorithm students.)
DS
- 数据结构第三版,适用于初学者学习使用，并且对C，C++已经学过的人。(DS third edition:Vector(using OOP to describe) includes List, Stack, Graph, Binary Tree and so on. it is better that you have learnt C and C++ previously, it will help you better learn the Data Structure especially
dijk
- Dijkstra算法解决voronoi图的问题(The Dijkstra algorithm solves the problem of voronoi diagram)
floyd
- Floyd算法又称为弗洛伊德算法、插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。(Floyd algorithm, also known as plug-in method, is an algorithm for finding the shortest path between vertices in a given weighted graph.)
winmerge
- used to merge 2 or multiple files