mofanwenti

这半查找法 是一种快速查找算法 查找效率比较高 容易实现 理想的查找算法(This search method is a fast and find more efficient algorithms to find easy to implement the ideal search algorithm)

纯C语言编程的模拟现有图书馆的借阅、续借、归还；图书入库、出库；查询、排序等功能，实现电子图书馆的智慧综合管理。其中查询功能里面嵌套精确查询，排序功能有六种，界面可变色，里面已经附带50多本图书信息包括图书摘要等详细信息。里面还附带详细设计报告和解说PPt。(Pure C language programming simulation existing library borrow, renew, return book storage, a library queries, sorting and other functions, to achieve integrated management of electronic library wisdom. Precisely where the query function inside a nested query, sort function has six, the interface can change color, which has included more than 50 books including books summary information and other details. Which also included detailed design reports and commentary PPt.)

这是一个二叉树的工程文件，包括了工程文件里的所有文件。以及二叉树的构建，traverse，搜索等功能函数。(This file contains a summary of what you will find in each of the files that make up your bTree application. )

关于随机发牌算法的小程序，作为数据结构的大作业，开发环境是VC(Random licensing algorithm for small procedures, as big job data structures, the development environment is VC)

　广度优先搜索及深度优先搜索，用C语言实现，比较使用(Breadth-first search and depth first search, using C language, compared with)

用c++实现的haffman tree 小程序，仅供参考 。 (The the haffman tree applet realized with c++ for reference only.)

二叉树类的前序，后序，层次遍历，其以链表方式存储(Binary tree class pre-order, post-order, hierarchy traversal, the linked list storage)

二叉树的中序遍历，先序遍历以及后序遍历的算法(Binary tree in preorder traversal, preorder traversal and postorder traversal algorithm)

二叉排序树的建立、插入与删除。按递增顺序插入N个整数，并按同样顺序删除；(Binary sort tree establishment, insertions and deletions. Insert N integers in ascending order, press the same sequence deleted )

文件的多路归并排序算法， C++描述（要求待排序文件已经事先有序）(C++ implementation of K-Merge Algorithm)