资源列表
TrainReset
- TrainReset:there are many trains need to drive out of the station .In terms of their numbers from small to large.There are only three railways used to place the trains ,and also need the same order.-TrainReset : there are many trains need to drive ou
Quicksort
- 在c++开发工具下实现的算法中的一个简单的快速排序算法。
cc
- 数据结构编程中用C/C++实现层次的非递归算法-Levels of non-recursive algorithm
poj1511.cpp.tar
- poj1511，最短路算法使用SPFA进行计算，建立两个图计算求值-poj1511, shortest path algorithm, using the SPFA, create two maps, calculate the evaluation
quick-sort
- 递归式快速排序代码。没有大小限制,最大限度加速-Recursive quick sort code. No size limit, the maximum acceleration
InsertSortApp
- 插入排序算法 , 使用Java语言实现，-insert sort alogrism
SelectSortApp
- 选择排序算法， 使用Java语言开发； -selection sort alogrism
ddt
- 多段图、遍历、排序。用C语言解决多段图中的成本问题，得出最佳优化方案。-More paragraphs figure, traverse, ranking. C language solve more paragraphs in the chart the cost, obtains the best optimization scheme.
huiwen
- vc++代码，判断一个链表中是否是回文链表，比如元素为abcba，1234321的链表是回文链表。-Vc++ code, determine whether the palindrome list is a list, such as the elements of abcba, 1234321 of the list is a palindrome list.
dijkstra
- dijkstra算法，解决最短路径问题。-dijkstra algorithm to solve the shortest path problem.
strcon
- 对于给定的n个字符串，请找出一种最佳的连接方式，使得采用该连接方式得到的字符串在所有连接的结果中，字典序最小-For a given n-string, find an optimal connection, making use of the connection string to get the results in all connections, the lexicographic minimum
POJ-2151
- POJ 2151 Check the difficulty of problems. Practice for dynamic planning.