资源列表
zuoye
- 用堆栈的方法，来实现两位数的简单四则运算。 -Stack method to achieve the simple four double-digit arithmetic operations.
zuoye
- 快速排序，北航数据结构课的第四次数据结构作业。-Quicksort, Beijing University of Aeronautics and Astronautics fourth data structure of the data structures course job.
hannuota
- 数据结构汉诺塔经典算法，包括详细的实现程序，适合学习数据结构的学生，理解数据结构算法。-Data structures classic Tower of Hanoi algorithm, including the detailed implementation procedures for student learning data structures, and understand the data structure algorithms.
xiaohaifentang
- 数据结构解决数学问题算法，关于小孩分糖果的问题算法实现。-Data structure to solve mathematical problems algorithms about the child points candy algorithm to achieve.
maze
- 用C语言，通过典型的线性数据结构栈来解决迷宫问题，算法与严蔚敏的数据结构中相同-C language, typical stack linear data structure to solve the maze problem, the same algorithm and data structure Yan Wei Min
guibingpaixu
- 归并排序，用数组的存储结构，实现数的排序。共有十组随机数据，还能够计算出每组数据的处理时间，最终得到平均时间。-Merge sort array storage structure, to achieve the sort of number. Ten set of random data, but also be able to calculate the processing time of each data, and eventually obtain the average time.
heapsort
- 堆排序，用数组的存储结构，构造大顶堆，实现数的排序。共有十组随机数据，还能够计算出每组数据的处理时间，最终得到平均时间。-Heap sort, with an array of storage structure, constructed big top heap to achieve the sort of number. Ten set of random data, but also be able to calculate the processing time of each data
InsertSort
- 直接插入排序，用数组的存储结构，实现数的排序。共有十组随机数据，还能够计算出每组数据的处理时间，最终得到平均时间。-Direct insertion sort, using an array of storage structure, to achieve the sort of number. Ten set of random data, but also be able to calculate the processing time of each data, and eventuall
jishupaixu
- 基数排序，用链表的存储结构，实现数的排序。共有十组随机数据，还能够计算出每组数据的处理时间，最终得到平均时间。-Radix sort, linked list storage structure to achieve a number of sort. Ten set of random data, but also be able to calculate the processing time of each data, and eventually obtain the average t
QuickSort
- 快速排序，用数组的存储结构，实现数的排序。共有八组随机数据，还能够计算出每组数据的处理时间，最终得到平均时间。-Quicksort array storage structure, to achieve the sort of number. A total of eight sets of random data, but also be able to calculate the processing time of each data, and eventually obtain the
Cluster
- 使用canopy算法实现的kmeans算法-Algorithm kmeans algorithm using the canopy
AVL_TREE
- 构建AVL树的相关C++程序，具有插入、删除、排序等功能。-To build the AVL tree C++ program, insert, delete, sort, and other functions.