|
|
|
|
| LEADER |
02262cam a2200253 cc4500 |
| 003 |
DE-603 |
| 005 |
20141105183407.0 |
| 007 |
tu |
| 008 |
081027s2007 xx |||| |00||u|ger|| |
| 020 |
|
|
|a 9780201314526
|
| 020 |
|
|
|a 0201314525
|
| 040 |
|
|
|a DE-603
|b ger
|c DE-603
|d HR-ZaFER
|e rakwb
|
| 041 |
|
|
|b eng
|
| 100 |
1 |
|
|a Sedgewick, Robert
|d 1946-
|4 aut
|
| 245 |
1 |
0 |
|a Algorithms in C /
|n parts 1-4
|p Fundamentals, data structures, sorting, searching
|c Robert Sedgewick
|
| 250 |
|
|
|a 3. ed., 22. print.
|
| 260 |
3 |
|
|a Boston [u.a.]:
|b Addison-Wesley,
|c 2014
|
| 300 |
|
|
|a XVII, 702 str.:
|b graf. prikazi;
|c 24 cm
|
| 504 |
|
|
|a Literaturangaben
|
| 505 |
0 |
0 |
|t Introduction. Algorithms. A sample problem-connectivity. Union-find algorithms. Perspective.
|t 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.
|t 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.
|t Special-purpose sorts. Batcher's odd-even mergesort. Sorting networks. External sorting. Sort-merge implementations. Parallel sort/merge.
|t 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.
|t Balanced trees. Randomized BSTs. Splay BSTs. Top-down 2-3-4 trees. Red-black trees. Skip lists. Performance characteristics.
|t Hashing. Hash functions. Separate chaining. Linear probing. Double hashing. Dynamic hash tables. Perspective.
|t Radix search. Digital search trees. Tries. Patricia tries. Multiway Tries and TSTs. Texting string index algorithms.
|t External searching. Rules of the game. Indexed sequential access. B trees. Extendible hashing. Perspective.
|
| 773 |
0 |
8 |
|w fer.(DE-603)135774136
|
| 900 |
|
|
|a HES
|d 002 kyb Cd 0.502-1/4, 3.Aufl.
|u 631002-3
|
| 942 |
|
|
|2 udc
|c K
|
| 999 |
|
|
|c 43135
|d 43135
|
