资源列表
Demo
- 数据结构中堆排序的代码实现。堆排序就是首先建立一个小顶堆或是大顶堆，然后把堆中最大的放到数组最后，再建立堆，再放到数组后面的位置-Data structure in the heap sort code. Heap sort is to first establish a small cap pile or pile top, and then put the heap s largest array in the end, to build pile, put them behind the
Demo
- 数据结构中快速排序的代码实现。快速排序的平均时间复杂度为 log2n,-Data structure in the quick sort code. The average time complexity of the quick sort log2n,
Demo
- 有关进制转换的代码实现。此代码能实现任意十进制、二进制、八进制的转换-The hexadecimal conversion code implementation. This code can realize arbitrary binary, octal, decimal and transformation
Demo
- 数据结构中的希尔排序算法。希尔排序算法是直接插入排序算法改进，时间复杂度降低了。-Hill sorting algorithms in data structure. Hill sorting algorithm is direct insertion sort algorithm is improved, and reduces the time complexity.
paixusuanfa
- 我自己写的一个关于数据结构中各种内部排序的时间复杂度的分析代码。里面有如何具体的实现，随机产生数组函数，还有对界面也略加设计。感觉对初学数据结构算法的人有一点帮助。-I write about a data structure in the analysis of time complexity in various internal sorting code. There are how to specific implementation, random array function, it
STL--Data-strcture-and-Alogrithm
- 数据结构C++语言描述——应用标准模板库（STL）（第2版） 源代码-Source Code for STL-Based Data structure and Alogrithm for C Plus Plus Programing
acm_data_struct
- acm/icpc比赛中有关数据结构题目的模板-the model about data struct in acm/icpc
acm_stirng
- acm/icpc比赛中有关字符串问题的模板-the model about string in acm/icpc
AVL-tree
- 1、以文本的形式输入平衡二叉树的数据，第一行为结点的个数，第二行为结点的值。并构造平衡二叉树 2、以文本的形式输出平衡二叉树的先序遍历，同一行中的两个数字之间用空白字符相隔。-1, in the form of text input balanced binary tree data, the number of the first acts of nodes, the value of the second node behavior. And constructs a balanced
BinaryTree
- 给出二叉树的先序遍历和中序遍历，递归构造出二叉树并打印结果-Given binary tree preorder and inorder traversal, recursive binary tree constructed and print the results
Huffman
- 哈夫曼树的建立，加密，解密，以及解析过程，含有菜单-Huffman tree establishment, encryption, decryption, and resolution process, containing menu
BankSimulation
- 银行排队叫号模拟系统算法设计，用于解决银行客户办理业务排队问题-Bank queuing algorithm design, station to station simulation system is used to solve the problem of bank customers to handle business line