算法设计的分支限界法中的单源最短路径问题的实现，是用VC＋＋编写的...

实现冒泡排序、插入排序、shell排序、快速排序、堆排序等经典排序算法，并对每个排序算法的代码行进行注释说明

n!不为0的最后一位，可以输出千万级别的阶乘最后一位-n! not the last one is 0, you can output level factorial million last

sysbase 12 用程序实现加卸载数据。

栈的应用-表达式求值2                                                                                                                                                                                                           ..............................................................................................................................................................................

Linux下的操作oracle数据库的连接库-Linux operating oracle database library

数据结构中的排序算法的比较-data structure of the algorithm comparison

思想很简单，就是一个循环链表 但要说明的是：我之所以用clist(1)来初始化，主要是我刚开始编的时候没打算解决约瑟夫环，只是想编一个带表头的循环链表，然后我用从这个程序改过来的，所以代码可以进一步优化。-Thinking is very simple, that is, a cycle list but would like to note is: I use clist (1) to initialize, mainly because I had just started when Joseph did not intend to resolve the ring, just want to provision a table with the head circulation list, and then I used to come from this process, so the code can be further optimized.

问题描述： 给定n个石子，其重量分别a1,a2,a3...an,要求将其划分成m份，每一份的划分费 义为这份石了中最大重量与最小重量的差的平方。总划分费用等丁m份划分费用之和。 编程任务 对于给定的n个石子，求一种划分方案，使得总划分费用最小。-Description of the problem: Given n-stones, its weight, respectively a1, a2, a3 ... an, asked that it be divided into m copies, each of the division of costs defined as the weight of the stone of the largest and the smallest weight difference the square. Small m the total costs were divided into the sum of the cost. Programming tasks for a given n-stones, seek a kind of division, making the total cost of the smallest division.

求最短路径问题,传给大家看看,希望能对大家在实用中有点帮助-seek the shortest path problem, we look at the pass, we hope to the right a little practical help