[[
Abstract Data Types and Algorithms
]]
Computer Science Student Wiki
Вы находитесь здесь:
Главная страница
»
Abstract Data Types and Algorithms
Abstract Data Types and Algorithms
Раздел в блоге CS Student
Не все лекции перенесены в вики. Вы можете
помочь
.
Содержание:
Java Review
Basic Java review for ADT
Inheritance
Interfaces and Packages
Recursion
Recursion
Analysis tools
Analysis of algorithms
Stacks and queues
Stacks
Queues
Examples
Lists and iterators
Linked lists
Vectors
Lists
Sequences and iterators
Trees
Trees
Priority queues
Priority queues
Heaps
Adaptable Priority Queues
Maps and dictionaries
Maps
Hash tables
Dictionaries
Skip lists
Search trees
Binary Search Trees
AVL Trees
(2,4) trees
Red-Black trees
Splay Trees
Sorting trees and selection
Merge sort
Quick sort
Divide-and-conquer
Sorting lower bound
Sets
Union-find partition structures
Radix sort
Selection
Text processing
Strings and Pattern Matching
Tries
Dynamic programming
Dynamic programming and LCS
Greedy method and text compression
Graphs
Graphs
Depth-first search
Breadth-first search
Directed graphs
Shortest paths
Minimum Spanning Trees
A campus tour project
abstract_data_types_and_algorithms/start.txt · Последние изменения: 2009/09/28 01:55 От freetonik
За исключением случаев, когда указано иное, содержимое этой вики предоставляется на условиях следующей лицензии:
CC Attribution-Noncommercial-Share Alike 3.0 Unported