Hash-table

使用的排序算法，非常不错的思维，比较其他有较大优势(Sorting algorithm used, very good ideas, have greater advantages compared with other)

一、 地理数据文件应用 对由点、线、面构成的地理数据文件进行打开、读取、关闭操作。 要求： 1、在C++环境下，通过程序设计实现文本格式数据文件的操作； 2、在打开数据文件后，生成点、线、面三个链表，分别用于记录三种类型的数据。 3、数据文件结构说明 (Geographic data file applications by point, line, surface consisting of geographic data file open, read, and close operations. Requirements: in C++ environment, through the program design text format data file operations 2, open the data file, generate points, lines, surfaces three linked list, respectively, for the record three types of data. 3, a data file structure)

kd-树（k维搜索树）是把二叉搜索树推广到多维数据的一种主存数据结构。这里给出了其代码的VC++实现(Classic data structures- KD tree full implementation, with a detailed explanation of the code, the novice data structure good materials)

利用串来比较数据大小，代码中有两个串，通过串来比较大小( 10/5000 Use the string to compare the data size)

利用双向链表实现对两大整数的相加运算。 可以修改数组长度实现更大整数的相加(Realize the use of two-way linked list of integers the sum of the two operations. Can modify the array length to achieve a greater sum of integers)

该代码实现了深拷贝的问题，对于深拷贝进行了一系列的介绍，并且显示其与浅拷贝的区别。(A deep copy of the code issues a series of deep copy for presentation, and shows the difference between a shallow copy.)

1.建立两个有序得链表（带表头，用头插法）； //2.写一算法在单链表上实现线性表的ListLength(L)运算。 写一算法将单链表中值重复的结点删除，使所得的结果表中各结点值均不相同。 (1. The establishment of two ordered lists too (with header, with the first interpolation) // 2. To write a method to achieve a single linked linear form of ListLength (L) operations. Write an algorithm to list the value of a single node to delete the duplicate, so the results in the table are not the same as the value of each node.)

数据结构与算法综合资料库,是一本很好的学习计算机的基础教程(Data Structures and Algorithms General database, are a very good tutorial to learn basic computer)

自己做的一个用用栈实现类的操作，是课内作业，希望和大家互相交流(Own a type used by the realization of the operation of the stack is class work, hope and we can exchange ideas)

算法分析与设计——大整数乘法。 计算两个超出机器数表示范围的整数的乘积。(Algorithm Analysis and Design- large integer multiplication. Calculating the number of two machines that go beyond the scope of the product of an integer.)