OTL4示例

java数据结构方面的，关于二叉树，很简单、实用-data structure, for the binary tree, a very simple, practical

因为用mfc做了一个应用程序，需要在没有数据库的情况下，读取excel中的数据，需要注意的是要在文件名前面加上强制类型转换符L

C++写的归并排序算法，非递归，简单高效-the nonrecursive code of mergesort

基本数据结构类的定义和实现: MyStack ,MyPoint,MyArc,Graph,MyQueuesMyStack为构造的一个通用的C++模版堆栈类 MyPoint为一个坐标结构MyArc为带权的边类Graph为临街矩阵表示的图MyQueues为按权值顺序存储的边的队列-basic data structure class definition and realization : MyStack, MyPoint, MyArc, Graph, MyQueuesMyStack for a generic structure of the C category MyPoint stack template for a structure MyArc to coordinate with the right side of the street like Graph Matrix plans MyQueues value of the order by the right side of the storage Queue

课程管理系统!有很强的排课功能，表多，联系多，是应付老师的首选，因为一看就是自己做的!-course management system. A strong Course Scheduling functions, tables, links, is the first choice to meet the teacher, because one can do for myself is!

这个是Hilbert曲线的实现算法,可以具体演示出每级曲线的绘制过程,最多可实现8级曲线的绘制.-Hilbert Curve is the realization of the algorithm can be demonstrated that each specific grade curve of the process of drawing up to achieve eight curve drawing.

这个

设n个不同的整数排好序后存于T[0:n-1]中。若存在一个下标I,0

基于十进制的四叉树的空间数据结构编码。 利用行数和列数求莫顿码 利用莫顿码求行数和列数-Decimal-based quadtree spatial data structure coding. To use the number of rows and columns seeking Morton Morton yards yards seeking to use the number of rows and columns

HANOI 塔问题求解.cpp，HANOI 塔问题是数据结构中具有典型的代表性问题-HANOI tower question solution cpp, the HANOI tower question is in the construction of data has the model the representative question