数据结构中栈的相关操作,数据结构中栈的相关操作

直接插入排序 排序过程：整个排序过程为n-1趟插入，即先将序列中第1个记录看成是一个有序子序列，然后从第2个记录开始，逐个进行插入，直至整个序列有序-Direct Insertion Sort to sort the process: the whole process of sorting times for the n-1 insert, that is, first sequence of the first one recorded as an orderly sequence, and then from the first two records began to insert one by one until the entire sequence has Preface

自己编的一个链表类。我自己经常用来管理内存的释放。还有两个字段用户可以自定义使用。-A calss, used to manage the data

外部排序的所有算法，在TC下经过调试，与吴伟民数据结构课本完全一致，用C实现-all external sorting algorithms, the TC under after debugging, and data structure Xiulan WU Weimin textbooks entirely consistent with achieving C

关于数据结构中的链表的各种应用和操作-With regard to the linked list data structure and operation of a variety of applications, etc.

access the database using Flash MX. Please remember that Flash is unable to natively access a database. A programming language (ASP in this case) provides the programming logic, while Flash works at the presentation tier of the application.

开括号和比括号的匹配，数据结构内容，很不错-More than brackets and brackets to open the match, the contents of data structure

旅行商问题： 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-traveling salesman problem : A salesman to a number of cities to sell commodities, known the distance between cities (or travel). He selected from a resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest.

TwoEmbranchmentTree:As ancestor has its children , a tree has its leaves. we could check its leaves in terms of algorithm as preorder , midorder or postorder.-TwoEmbranchmentTree : As ancestor has its children, a tree has its leaves. we could check its leaves i n terms of algorithm as preorder. midorder or postorder.

实现岛上建立公路的最短路径算法，调用了dikstra算法-Highway on the island to achieve the establishment of the shortest path algorithm, called algorithm dikstra

一个组态王6.53的实例，小球走椭圆轨道，适合初学者参考。-An instance of KingView 6.53, the small ball go elliptical orbit, suitable for advanced users.