The stack data structure in the classic method

51aspx源码必读.txt   dianyingyuan.sln   ............AbouForm.cs   ............AbouForm.Designer.cs   ............AbouForm.resx   ............inDebugone.jpg   ....................dianyingyuan.exe   ....................dianyingyuan.pdb   ....................dianyingyuan.vshost.exe   ....................gongfu.jpg   ....................lost10-001-3.txt   ....................lost10-001-4.txt   ....................lost10-001-5.txt   ....................lost12-001-4.txt   ....................lost8-001-3.txt   ....................lost8-001-4.txt   ....................Sava.txt   ....................ShowList.xml   ....................spiderman3.jpg

优先数调度处理器算法，实现处理器调度的程序，-Processor scheduling algorithm is priority number to achieve processor scheduling procedures,

fsdfsadfsdfsdfsdgdgdgfg dsfg sdfg dsf gsdfg sdfgsdfg gddflskgksd gdfsjklgjklsd kldfg jsdfj klgsfsgfsgjkl；sg dfg osdpg posdfig ；goipdf gdfpogsdf opsdf gspdo sdfpo gisdf gpsdfog ipsdfg sdfop gisdfpogg ；fsadfsdfsddfgdgfg dfgfgfg sdfg dsdfg gsdfg gsdfg sdfgsdfg gdfgsdfg gdgfgsdfg gdfsjkldfg jsdfj klgsfsgfsgjkl；sg dfg osdpg posggoipdf gdfpogsdf opsdf gspdo sdfpo gisdf gpsdfog ipsdfg sdfop gisdfpog fsdfsadfsdgfg dfgdgfg dsfg sdfg dsf gsdfg sdfgsdfg sdfgsdfg gfd g gjdflskgksd gdfsjklgsd kldfg jsdfj klgsfsgfsgjkl；sg dfg osdpg posdfig goipf gdfog opsdf gspdo sdfpo gisdf gpsdfog ipsdfpog；fsdfsadfsdfsdfsdgdgdgfg dsfg sdfg dsf gsdfg sdfgsdfg gddflskgksd gdfsjklgjklsd kldfg jsdfj klgsfsgfsgjkl；sg dfg osdpg posdfig ；goipdf gdfpogsdf opsdf gspdo sdfpo gisdf gpsdfog ipsdfop gisdfpog ；

希望大家能多多指教这是我给我们同学编的系统-hope that we can enlighten a lot to me this is part of our classmates system

对文件中的数据进行哈夫曼编码和解码,列出给定数据的权重,列出左右孩子和父亲节点的列表,对任意数据进行进行哈夫曼编码和解码-to document the data Huffman coding and decoding, data presents given weight, shown around children and the father node list of arbitrary data for Huffman coding and decoding

这是一个数据结构小程序，有关计算加减法的-This is a small program data structure, addition and subtraction in the calculation of

算法类，合并排序的源代码，来自算法导论上的-Algorithm category, the combined ranking of the source code, from the Introduction to Algorithms

本程序实现各种排序算法并分析与比较 直接插入排序， SHELL排序，冒泡排序，快速排序，简单选择排序，堆排序，归并排序-procedures for the realization of the algorithm and analysis more directly inserted, in order of ranking SHELL, Bubble Sort, rapid sequencing, simple choice, in order of ranking sculpture, merging Sorting

汉诺塔演示程序，用VB做成的图形界面，能够实现汉诺塔问题，也即是把N个盘子从一根棍上移到另一根上面，通过中转的棍，但是必须保证在每根棍上都是下面的盘子大于上面的盘子。-HANOR demo program using VB create graphical interface to HANOR problems, that is, N dishes from one club to another on the above-through the interchange stick, but it must be guaranteed in each stick-on the following dishes are greater than the above dishes.

马的遍历问题。在中国象棋棋盘上，对任一位置上放置的一个马，均能选择合适的路线，使得该棋子能够按象棋的规则不重复的走过棋盘上的每一个位置。-Traversal problem horses. In Chinese chess chessboard, for any one location to place a horse, able to choose the right line, making the chess pieces according to chess rules can not repeat the past chessboard for each location.