|
||||
| Description: | ||||
| Basic techniques for estimating the efficiency of algorithms. Searching algorithms: sequential, binary, Fibonacci, tree search, tries, hashing (study of several hash functions). Sorting algorithms: heapsort, mergesort, quicksort, binsort. Balanced trees: AVL trees, Hoffman's algorithm. Equivalence relations and compressed balanced trees. Topological sorting. External sorting: merge sorting, multiway merge, B-trees (2-3 trees, 5-way trees). | ||||
|