库存报告

直接插入排序 排序过程：整个排序过程为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

二叉树遍历 包括先序遍历 中序遍历 后序遍历 求结点个数 求树的深度-Including the first order binary tree traversal traversal sequence in order to postorder traversal node number and ask for the depth of

同时rear和len分别指示环形队列中队尾元素的位置和内含元素的个数。设计相应的入队和出队算法。-At the same time, rear and len, respectively, annular instructions squadron tail queue element containing the location and the number of elements. Design corresponding to the team and the team algorithm.

力控组态软件和extremedb实时数据库接口-ForceControl configuration software and real-time database interface eXtremeDB

用VC实现数据结构中冒泡排序，快速排序，希尔排序等各种改进排序算法-Data structure with the VC bubble sort, quick sort, Shell sort and other sorting algorithm to improve

一个封装好的优先队列,用C++实现的,已经经过调试,直接用就行-A good package priority queue, using C++ Realize, and have been debugging directly on the line

皇后问题，第2解法! 皇后问题，第2解法!-Queen

三个修道士和三个野人过河，船一次最多只能载两个人，在任何时候修道士的人数不能少于野人人数，否则野人会吃掉修道士。找出六个人顺利过河的所有方案。 

[问题描述] 在二叉排序树中查找关键字为KEY的记录 [输入] 有序表输入要查找元素的关键字 [输出] 查找成功是即可显示查找成功 #include #include typedef int KeyType typedef struct{ -[Problem Description] Binary Tree ranking keyword search for the records KEY [imported] ordered to investigate the importation of table find elements of the keyword search [output] is successful you can show success# include

这个程序时还没有powerdesigner,erwin的时候出现的，到现在也实用，需要fmt的一个格式文件来描述表结构，执行完毕形成xxx.sql语句，然后isql -Usa -P -Sservname -ixxx.sql即可-this procedure was no powerdesigner, erwin the time and it has practical need fmt format of a table to describe the structure, finished form xxx.sql statement, and then isql-Usa- P-Sservname-can ixxx.sql