CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - splay
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Search - splay - List
[
Compress-Decompress algrithms
]
SPLAY
DL : 0
The program SPLAY is a pascal to C translation of a program that Kim Kokkonen wrote in Turbo Pascal to implement Splay Trees. This program compresses and decompresses files, and does a pretty good job of it. Contents: SPLAY.PAS Original TP source code SPLAY.C Translation of code to C SPLAY.EXE Compiled version of SPLAY.C (small model) README.DOC You are looking at it Read the comments at the beginning of SPLAY.C for more info. -The program is a pascal to C translati on of a program that Kim Kokkonen wrote in Turbo P Akam to implement Splay Trees. This program co mpresses and decompresses files, and does a pretty good job of it. Contents : TP SPLAY.PAS Original source code SPLAY.C Tran slation of code to C SPLAY.EXE Compiled version of SPLAY.C (small model) README.DOC You are loo king at it Read the comments at the beginning of S PLAY.C for more info.
Date
: 2008-10-13
Size
: 4.56kb
User
:
王子秋
[
Game Program
]
splay tree 源碼
DL : 0
splay tree 源碼splay tree 源碼
Date
: 2012-06-14
Size
: 1.37kb
User
:
qweqaz
[
Data structs
]
splayTree
DL : 0
主要是avl,splay和binary树的insert,delete程序,主要是avl,splay.binary树的-mainly AVL, SED and the binary tree insert, delete procedures, mainly AVL, splay.binary tree
Date
: 2025-07-13
Size
: 3kb
User
:
往常
[
Compress-Decompress algrithms
]
SPLAY
DL : 0
The program SPLAY is a pascal to C translation of a program that Kim Kokkonen wrote in Turbo Pascal to implement Splay Trees. This program compresses and decompresses files, and does a pretty good job of it. Contents: SPLAY.PAS Original TP source code SPLAY.C Translation of code to C SPLAY.EXE Compiled version of SPLAY.C (small model) README.DOC You are looking at it Read the comments at the beginning of SPLAY.C for more info. -The program is a pascal to C translati on of a program that Kim Kokkonen wrote in Turbo P Akam to implement Splay Trees. This program co mpresses and decompresses files, and does a pretty good job of it. Contents : TP SPLAY.PAS Original source code SPLAY.C Tran slation of code to C SPLAY.EXE Compiled version of SPLAY.C (small model) README.DOC You are loo king at it Read the comments at the beginning of S PLAY.C for more info.
Date
: 2025-07-13
Size
: 4kb
User
:
王子秋
[
Compress-Decompress algrithms
]
LDSToolkit1.1
DL : 0
Lossless Data Compression Toolkit Version 1.1 of the lossless data compression toolkit by Nico deVries. The C sources in this toolkit include an LZW compressor, AR002 archiver, a PPM like compressor using arithmetic compression, Huffman compressor, splay tree program, and LZRW1. Quite a variety. -Lossless Data Compression Toolkit Versio n 1.1 of the lossless data compression toolkit b y Nico deVries. The C sources in this toolkit inc lude an LZW compressor, AR002 archiver. PPM like a compressor using arithmetic compres sion, Huffman compressor, splay tree program, and LZRW1. Quite a variety.
Date
: 2025-07-13
Size
: 94kb
User
:
jason..
[
Data structs
]
Splay
DL : 0
伸展树 都知道如果使用二叉查找树树平衡度不好则会降低查询效率,所以我们要维护二叉树的平衡性,即TreapTree 、SplayTree 、AVL、红黑等,本文介绍伸展树的平衡原理和核心代码 -Tree stretching all know if you use binary search tree tree balance will not reduce the query efficiency, and therefore we have to safeguard the balance tree that TreapTree, SplayTree, AVL, red and black, etc. This article describes the principle of extending the balance of the tree and the core code
Date
: 2025-07-13
Size
: 184kb
User
:
sql
[
CSharp
]
treetime
DL : 0
一个数据结构的课程作业,用来比较avltree,splay tree,平衡树之间的插入删除操作的时间,平均时间,内有这3种树的实现代码-A data structure course operations, to compare avltree, splay tree, balanced tree insertion between the delete operation time, average time, which has 3 planting the realization of this code
Date
: 2025-07-13
Size
: 61kb
User
:
卢杨
[
Data structs
]
rbtree
DL : 0
红黑树是一种自平衡二叉查找树,是在计算机科学中用到的一种数据结构,典型的用途是实现关联数组。-AVL trees are actually easier to implement than RB trees because there are fewer cases. And AVL trees require O(1) rotations on an insertion, whereas red-black trees require O(lg n). In practice, the speed of AVL trees versus red-black trees will depend on the data that you re inserting. If your data is well distributed, so that an unbalanced binary tree would generally be acceptable (i.e. roughly in random order), but you want to handle bad cases anyway, then red-black trees will be faster because they do less unnecessary rebalancing of already acceptable data.On the other hand, if a pathological insertion order (e.g. increasing order of key) is common, then AVL trees will be faster, because the stricter balancing rule will reduce the tree s height. Splay trees might be even faster than either RB or AVL trees,depending on your data access distribution. And if you can use a hash instead of a tree, then that ll be fastest of all.
Date
: 2025-07-13
Size
: 8kb
User
:
kark
[
Windows Develop
]
splay
DL : 0
SPLAY的模板,方便大家使用,可以直接粘贴使用-SPLAY template to facilitate the use of paste can be directly used
Date
: 2025-07-13
Size
: 1kb
User
:
lcx
[
Windows Develop
]
SplayTree
DL : 0
A C++ implementation of Splay Tree.
Date
: 2025-07-13
Size
: 3kb
User
:
lionmoa
[
TreeView
]
splaytreeee
DL : 0
Splay tree implementation data structures
Date
: 2025-07-13
Size
: 1kb
User
:
abcdefglksl
[
Data structs
]
Splay
DL : 0
Splay Tree,伸展树,一种实现简单的平衡二叉树,增删改查的时间复杂度均为O(logN)-Splay Tree
Date
: 2025-07-13
Size
: 638kb
User
:
liuyulei
[
Data structs
]
binary_tree
DL : 0
根据Kurse版数据结构书改成的电子版课件。此章包括二叉树的概念,结构,遍历,线索二叉树,二叉搜索树,平衡二叉树,splay树-According to the data structure Kurse version of the book into electronic version of the courseware. This chapter includes the concept of binary tree structure, traversal, threaded binary tree, binary search tree, balanced binary tree, splay tree
Date
: 2025-07-13
Size
: 566kb
User
:
黄蔼婧
[
VC/MFC
]
HDU-3487-splay
DL : 0
Splay 伸展树 HDU 3487模板-Splay tree HDU 3487 template extension ...
Date
: 2025-07-13
Size
: 1kb
User
:
xyh
[
Data structs
]
splay-tree
DL : 0
Splay tree in C language
Date
: 2025-07-13
Size
: 2kb
User
:
ramya
[
Data structs
]
splay
DL : 0
强大的数据结构--splay。splay是一种简洁易写的平衡树。splay在ACM竞赛中用重要的应用。-Powerful data structure- splay. splay is a simple and easy to write a balanced tree. splay ACM contest with important applications.
Date
: 2025-07-13
Size
: 8kb
User
:
star
[
Data structs
]
Splay
DL : 0
splay tree,动态平衡树的一种,应用比较灵活-splay tree, the dynamic balance of a tree, the application is more flexible
Date
: 2025-07-13
Size
: 2kb
User
:
可可
[
Delphi VCL
]
splay
DL : 0
splay 伸展树 还不错的代码,大家可以-the splay stretch tree also good code, we can see
Date
: 2025-07-13
Size
: 2kb
User
:
fjsnowmail
[
Data structs
]
Splay-for-number-list
DL : 0
伸展树Splay在数列处理问题上的应用的教程与源代码,含有pas和cpp。-A director of Splay tree for the usage to solve the problem with number list
Date
: 2025-07-13
Size
: 268kb
User
:
chen andy
[
Data structs
]
Splay
DL : 0
splay代码,各种splay的题目,和各种题目的来源以及题目的代码-Source splay code, various splay of topics, and a variety of topics and subject code
Date
: 2025-07-13
Size
: 69kb
User
:
tlwlmy
«
1
2
3
4
»
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.