国家集训队2005论文集 i魏冉.doc

让算法的效率“跳起来”！ —— 浅谈“跳跃表”的相关操作及其应用 上海市华东师范大学第二附属中学 魏冉 【目录】 ◆ 关键字 ························································································ 【2】 ◆ 摘要 ························································································ 【2】 ◆ 概述及结构 ·················································································· 【2】 ◆ 基本操作 ························································································· 【3】 ◇ 查找 ·················································································· 【3】 ◇ 插入 ·················································································· 【3】 ◇ 删除 ·················································································· 【4】 ◇ “记忆化”查找 ····································································· 【5】 ◆ 复杂度分析 ·················································································· 【6】 ◇ 空间复杂度分析 ······································································ 【7】 ◇ 跳跃表高度分析 ······································································ 【7】 ◇ 查找的时间复杂度分析 ························································· 【7】 ◇ 插入与删除的时间复杂度分析 ·················································· 【8】 ◇ 实际测试效果 ····································································· 【8】 ◆ 跳跃表的应用 ············································································ 【9】 ◆ 总结 ························································································· 【10】 ◆ 附录 ························································································· 【11】 【关键字】 跳跃表 高效 概率 随机化 【摘要】 本文分为三大部分。 首先是概述部分。它会从功能、效率等方面对跳跃表作一个初步的介绍，并给出其图形结构，以便读者对跳跃表有个形象的认识。 第二部分将介绍跳跃表的三种基本操作——查找，插入和删除，并对它们的时空复杂度进行分析。 第三部分是对跳跃表应用的介绍，并通过实际测试效果来对跳跃表以及其它一些相关数据结构进行对比，体现其各自的优缺点。 最后一部分是对跳跃表数据结构的总结。 【概述及结构】 二叉树是我们都非常熟悉的一种数据结构。它支持包括查找、插入、删除等一系列的操作。但它有一个致命的弱点，就是当数据的随机性不够时，会导致其树型结构的不平衡，从而直接影响到算法的效率。 跳跃表（Skip List） 跳跃表由多条链构成（S0，S1，S2 ……，Sh），且满足如下三个条件： 每条链必须包含两