Binary search tree
Binary search tree A binary search tree of size 9 and depth 3, with ... 7 and 13. In computer science, a binary search tree (BST) is a binary ...
http://en.wikipedia.org/wiki/Binary_search_tree - 21k - Cached - Similar pages

Binary tree of research   (translated from French)
Binary tree of research Example representing a binary tree of research In data processing , one binary tree of research (ABR) is one ...
http://fr.wikipedia.org/wiki/Arbre_binaire_de_recherche - 8k - Cached (French) - Wikipedia (French) - Similar pages

Self-balancing binary search tree
Self-balancing binary search tree In computing, a self-balancing binary search tree or height-balanced binary search tree is a binary search ...
http://en.wikipedia.org/wiki/Self-balancing_binary_search_tree - 7k - Cached - Similar pages

Radix sort
Radix sort A Radix sort is a fast stable sorting algorithm which can be used to sort items that are identified by unique keys ... is a string or number, and radix sort sorts these keys in some particular lexicographic ... It is also known as a Postal sort. The algorithm operates in O(n ...
http://en.wikipedia.org/wiki/Radix_sort - 43k - Cached - Similar pages

Insertion sort
Insertion sort Insertion sort is a simple sort algorithm, a comparison sort in which the sorted array (or list ... algorithms such as quicksort, heapsort, or merge sort, but it has various advantages: Simple ...
http://en.wikipedia.org/wiki/Insertion_sort - 14k - Cached - Similar pages

Binary heap
Binary heap Example of a complete binary max heap. Example of a complete binary min heap. Binary heaps are a particularly simple kind of heap data structure created using a binary tree. It can be seen as ...
http://en.wikipedia.org/wiki/Binary_heap - 11k - Cached - Similar pages

Splay tree
Splay tree A splay tree is a self-balancing binary search tree with the additional unusual property that recently ... of the sequence is unknown. The splay tree was invented by Daniel Sleator and ...
http://en.wikipedia.org/wiki/Splay_tree - 14k - Cached - Similar pages

Comparison sort
Comparison sort A comparison sort is a particular type of sorting algorithm ... comparison sorts include: Quicksort Heapsort Mergesort Insertion sort Selection sort Bubble sort Some examples of sorts which are ...
http://en.wikipedia.org/wiki/Comparison_sort - 8k - Cached - Similar pages

Sort algorithm   (translated from Chinese)
Sort algorithm So-calledArrangementCauses a string record, according ... contents Minute □ In computer science uses sort algorithm usually by minute □□: □calculates□□（Worst、AverageSumBestTable □ ... ideal table □isO(N). □uses in the sort algorithm □average which one □is abstract □□compares ... all that □□□source use) □decides:□decides the sort algorithm□according to is equal □□(□word is ... arrangement to contain the bubbling arrangement (bubble sort) and the fast arrangement (quicksort). □□the ...
http://zh.wikipedia.org/wiki/排序算法 - 16k - Cached (Chinese) - Wikipedia (Chinese) - Similar pages

Binary space partitioning
Binary space partitioning Binary space partitioning (BSP) is a method for ... of the scene by means of a tree data structure known as a BSP tree. For a more general description of space ... Z-buffer and eliminate the need to sort the objects as a simple tree ...
http://en.wikipedia.org/wiki/Binary_space_partitioning - 10k - Cached - Similar pages