Algorithms in C
| Permalink: | http://skupni.nsk.hr/Record/fer.KOHA-OAI-FER:43135/TOC |
|---|---|
| Glavni autor: | Sedgewick, Robert 1946- (Author) |
| Vrsta građe: | Knjiga |
| Jezik: | ger |
| Impresum: |
Boston [u.a.]:
Addison-Wesley,
2014
|
| Izdanje: | 3. ed., 22. print |
Sadržaj:
- Introduction. Algorithms. A sample problem-connectivity. Union-find algorithms. Perspective.
- Principles of algorithm analysis. Implementation and empirical analysis. Analysis of algorithms. Growth of functions. Big-oh notation. Basic Recurrences. Examples of algorithm analysis. Guarantees, predictions and limitations. Algorithms on heaps, Heapsort. Priority-queue ADT. Priority queues for index items. Binomial queues.
- Radix sorting. Bits, bytes, and words. Binary quicksort. MSD radix sort. Three-way radix quicksort. LSD radix sort. Performance characteristics of radix sorts. Sublinear-time sorts.
- Special-purpose sorts. Batcher's odd-even mergesort. Sorting networks. External sorting. Sort-merge implementations. Parallel sort/merge.
- Symbol tables and BSTs. Symbol-table abstract data type. Key-indexed search. Binary search. Binary search trees (BSTs). Performance characteristics of BSTs. Index implementations with symbol tables. Insertion at the root in BSTs. BST implementations of other ADT Functions.
- Balanced trees. Randomized BSTs. Splay BSTs. Top-down 2-3-4 trees. Red-black trees. Skip lists. Performance characteristics.
- Hashing. Hash functions. Separate chaining. Linear probing. Double hashing. Dynamic hash tables. Perspective.
- Radix search. Digital search trees. Tries. Patricia tries. Multiway Tries and TSTs. Texting string index algorithms.
- External searching. Rules of the game. Indexed sequential access. B trees. Extendible hashing. Perspective.