LStack

魔方问题 数据结构 使用c++ 经典问题(Cube problem Data Structure Using c++ Classic problem)

数据结构上机操作实验的实验1，线性表的基本操作！！！(the basic operation of sq of date structure)

电梯模拟，实现一个模拟电梯的环境，用C程序实现的，封装良好(elevator modify)

纯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.)

数据结构一书上 关于迷宫游戏的算法 (Book on data structure algorithms on maze game)

c语言编写链式线性表的初始化，创建，插入删除等操作。(c language chained linear table is initialized, create, insert and delete operations.)

数据结构的一些基本的相关的试验，如二叉树的遍历，打印，如排序算法，检索算法，动态结构的静态实现实验(Data structures related to some basic tests, such as binary tree traversal, print, such as sorting algorithms, search algorithms, the dynamic structure of the realization of the experimental static)

对于给定的n个字符串，请找出一种最佳的连接方式，使得采用该连接方式得到的字符串在所有连接的结果中，字典序最小(For a given n-string, find an optimal connection, making use of the connection string to get the results in all connections, the lexicographic minimum)

用分治算法（O(nlogn)复杂度）实现寻找n个点中最邻近点对,输出为最邻近距离的平方(Looking for n points nearest point, the output of the nearest neighbor distance squared using the divide-and-conquer algorithm (O (nlogn) complexity))

简单选择排序，这是个解决排序问题的一个算法模型之一。(Sort simple choice, this is a solution to a scheduling problem, one algorithm model.)