资源列表
c-hash
- c语言查找字符串的hash算法,几种经典的哈希算法参考-hash algorithm
tree_traverse
- 二叉树遍历,包括二叉树的创建，插入，删除-Binary tree traversal, including the creation of a binary tree, insert, delete
max_heap
- 该文件包括了堆的相关操作，向上堆化，向下堆化，以及相应的堆排序-The document includes a heap of related operations, the heap of up and down the heap of, and the corresponding heap sort
2
- 本文件包含《数据结构》第二章的相关习题源码，全部可运行。开发平台为visual C++6.0-This document contains " data structure" associated exercises in Chapter II source, the entire operation. Development platform for the visual C++6.0
3
- 本文件包含《数据结构》第三章部分习题源码，全部可运行，开发平台为visual C++6.0-This document contains " data structure" part of exercises of Chapter III source, the entire operation, development platform for the visual C++6.0
11
- 平衡二叉树的样式，插入删除，排序。，平衡二叉树的样式，插入删除，排序 平衡二叉树的样式，插入删除，排序-Balanced binary tree style, insert delete, sort. Balanced binary tree style, insert delete, sort, style balanced binary tree, insert delete, sort, style balanced binary tree, insert delete, sort,
Exp8_redblacktree
- 《数据结构》学习中著名的红黑树源码，可运行。开发平台为visual C++6.0 -" Data Structure" in the famous red-black tree learning source, run. Development platform for the visual C++6.0
tree
- 由用户输入先序和中序序列，以此构造一棵二叉树；然后对二叉树进行层次遍历，先序中序后序遍历；并且计算出这棵树的第一条最长路径并将其打印出来。-By the user input sequence and the first order sequence as a binary tree structure then the level of binary tree traversal, inorder postorder preorder traversal and calculate the
Sort
- 数据结构各种排序的性能比较：移动次数，时间长短等-Data structure performance comparison of various sort: mobile number, duration, etc.
projectSharp3
- code using binary tr-code using binary tree
01
- c++利用回溯法来实现01背包问题 阶段是：在前N件物品中，选取若干件物品放入背包中； 状态是：在前N件物品中，选取若干件物品放入所剩空间为W的背包中的所能获得的最大价值； 决策是：第N件物品放或者不放； -c++ using backtracking to achieve the 01 knapsack problem Stage: the first N items, select the number of items into the backpack status
AllRange
- 自己定义的生成全排列的算法，可以适用于任何容器.c-Own definition of permutation generation algorithm can be applied to any container. Cpp