搜索资源列表
RBTreeCode
- 红黑树和二叉查找树数据结构的实现以及二者的性能比较的C语言实现代码-Red and black binary search tree and the tree data structure, as well as the achievement of the performance comparison between the C language code
STLinusagemap
- map中由于它内部有序，由红黑树保证，因此很多函数执行的时间复杂度都是log2N的，如果用map函数可以实现的功能，而STL Algorithm也可以完成该功能，建议用map自带函数，效率高一些。 -map due to its internal and orderly to ensure the tree by the red and black, many functions of the time complexity of the implementation are log2N,
red_black_tree
- data structure black and red tree.
cprops
- The cprops (C prototyping tools) library provides a portable, thread-safe C API including linked list, binary heap, priority queue, hash table, hash list, trie, AVL, Red-Black, and splay tree implementations, a thread pool and thread management fra
stx-btree-0.8.6.tar
- The STX B+ Tree package is a set of C++ template classes implementing a B+ tree key/data container in main memory. The classes are designed as drop-in replacements of the STL containers set, map, multiset and multimap and follow their interfaces very
structure
- 各种各样的高级数据结构原理以及C++实现，例如红黑树，哈希表，笛卡尔树，字典树，斐波那契堆，二叉堆，SBT等等。-The wide range of advanced data structural principle C++ of implementation, such as red-black trees, hash tables, Cartesian tree dictionary tree, Fibonacci heap, binary heap, SBT and so on.
rbt2
- 利用红黑树实现字符串的快速查找，在测试中发现要比哈希查找要快，在一百万个字符串查找每一个字符串，大概50us左右。-Using red and black tree to realize the rapid search string, in tests found than hash find fast, in one million a string search each string, about 50 around us.
ED2---Tarea-2---CodigoFuente---FabioCarvajal--Fra
- C++ red and black tree implementation
Timer
- 以最小堆、红黑树、时间轮三种方式实现定时器，时间轮效率最高，非常具有参考价值！-With the minimum heap, red and black tree, time round three ways to realize timer, time round the highest efficiency, has the reference value very much!
RBTree
- 算法导论中红黑树插入删除源码,自己编写的 亲测可用-Introduction to algorithms in the red and black tree insert to delete the source code
roadPro
- 包含多种排序算法，对60000多条信息进行文件的存取操作，包含冒泡排序，快速排序，堆排序，红黑树排序等操作(Contains a variety of sorting algorithms to access more than 60000 information files, including bubble sorting, fast sorting, heap sorting, and red and black tree sorting.)