搜索资源列表
SkipList
- 分级链表（Skiplists）数据结构的实现-Categorization List (Skiplists) data structure to achieve
数据结构的C++描述
- 目 录 译者序 前言 第一部分 预备知识 第1章 C++程序设计 1 1.1 引言 1 1.2 函数与参数 2 1.2.1 传值参数 2 1.2.2 模板函数 3 1.2.3 引用参数 3 1.2.4 常量引用参数 4 1.2.5 返回值 4 1.2.6 递归函数 5 1.3 动态存储分配
SkipList
- SKiplist是一种概率应用于平衡树的替换数据结构。-Skip list is a probabilistic alternative to balanced trees that provide much of the simplicity of unbalanced trees , togethere with good worst-case expected performance.
dictionary-skiplist-hashtable
- 数据结构的C++实现：字典的链表实现、线性开型寻址散列、链表散列（环境：VS2008）-C++ data structures to achieve: a dictionary of the list to achieve a linear open addressing hash based, hash list (Environment: VS2008)
skiplist.c.tar
- A skip list is a data structure for storing a sorted list of items, using a hierarchy of linked lists that connect increasingly sparse subsequences of the items. These auxiliary lists allow item lookup with efficiency comparable to balanced binary se
skiplist
- 跳转表,随机化的数据结构.插入logn,查询logn.但是占用空间较大.-skip list
skiplist
- 实现c++数据结构中的跳表，是一种特殊形式的单链表, 运算较快-it realize the skiplist data stucture, which is a special kind of list calculating in a faster speed
skepTable
- skipList，跳表。使用c++实现，无测试用例，可直接加到项目中使用-skipList，can be directly put into projects.
skiplist
- 跳表的实现 哈工大软件设计与开发 优秀代码 分享交流 excellent coding for studying- excellent coding for studying