Taylor's Library

Normal view MARC view ISBD view

Algorithms in C / Robert Sedgewick

By: Sedgewick, Robert, 1946-.
Publisher: Boston, Mass. : Addison-Wesley, c1998, c2002Edition: 3rd ed.Description: 2 v. : ill. ; 24 cm.ISBN: 0201314525 (pts. 1 - 4); 0201316633 (pt. 5).Subject(s): C (Computer program language) | Computer algorithmsDDC classification: 005.133
Contents:
Part 5: Graph algorithms: Ch. 17. Graph properties and types. - Ch. 18. Graph search. - Ch. 19. Digraphs and DAGs. - Ch. 20. Minimum spanning trees. - Ch. 21. Shorter paths. - Ch. 22. Network flows. - Reference for part five. - Index.
Parts 1-4: Fundamentals : Ch. 1. Introduction. - Ch. 2. Principles of algorithm analysis. - Data Structures: Ch. 3. Elementary data structures. - Ch. 4. Abstract data types. - Ch. 5. Recursion and trees. - Sorting: Ch. 6. Elementary sorting methods. - Ch. 7. Quicksort. - Ch. 8. Merging and mergesort. - Ch. 9. Priority queues and heapsort. - Ch. 10. Radix sorting. - Ch. 11. Special-purpose sorts. - Searching: Ch. 12. Symbol tables and BSTs. - Ch. 13. Balanced Trees. - Ch. 14. Hashing. - Ch. 15. Radix search. - Ch. 16. External searching. - Index.
[1], pts. 1-4. Fundamentals, data structures, sorting, searching. [2], pt. 5. Graph algorithms.
Item type Current location Shelf location Call number Vol info Copy number Status Notes Date due Barcode
Main Collection Taylor's Library-TU

Floor 3, Shelf 1 , Side 1, TierNo 6, BayNo 1

 005.133 SED (Browse shelf) PART 5 1 Available SOCIT,15008,03,AD 5000041177
Main Collection Taylor's Library-TU

Floor 3, Shelf 1 , Side 1, TierNo 6, BayNo 1

 005.133 SED (Browse shelf) PARTS 1-4 1 Available SOCIT,15009,03,AD 5000041167

Part 5: Graph algorithms: Ch. 17. Graph properties and types. - Ch. 18. Graph search. - Ch. 19. Digraphs and DAGs. - Ch. 20. Minimum spanning trees. - Ch. 21. Shorter paths. - Ch. 22. Network flows. - Reference for part five. - Index.

Parts 1-4: Fundamentals : Ch. 1. Introduction. - Ch. 2. Principles of algorithm analysis. - Data Structures: Ch. 3. Elementary data structures. - Ch. 4. Abstract data types. - Ch. 5. Recursion and trees. - Sorting: Ch. 6. Elementary sorting methods. - Ch. 7. Quicksort. - Ch. 8. Merging and mergesort. - Ch. 9. Priority queues and heapsort. - Ch. 10. Radix sorting. - Ch. 11. Special-purpose sorts. - Searching: Ch. 12. Symbol tables and BSTs. - Ch. 13. Balanced Trees. - Ch. 14. Hashing. - Ch. 15. Radix search. - Ch. 16. External searching. - Index.

[1], pts. 1-4. Fundamentals, data structures, sorting, searching. [2], pt. 5. Graph algorithms.