Algorithms in Java, 3/e
Robert Sedgewick
- 出版商: Addison Wesley
- 出版日期: 2002-07-23
- 售價: $2,700
- 貴賓價: 9.5 折 $2,565
- 語言: 英文
- 頁數: 768
- 裝訂: Paperback
- ISBN: 0201361205
- ISBN-13: 9780201361209
-
相關分類:
Java 程式語言、Algorithms-data-structures
已過版
買這商品的人也買了...
-
$950$751 -
$690$538 -
$480$374 -
$980$774 -
$1,710$1,625 -
$860$679 -
$1,500$1,470 -
$450$351 -
$550$435 -
$590$466 -
$280$221 -
$480$408 -
$680$537 -
$480$374 -
$690$538 -
$650$507 -
$420$332 -
$720$562 -
$780$616 -
$600$474 -
$490$387 -
$720$569 -
$500$395 -
$560$442 -
$590$531
相關主題
商品描述
For the first time Sedgewick's seminal work on algorithms and data structures is available with implementations in Java. Michael Schidlowsky and Sedgewick have developed new Java code that both expresses the methods in a concise and direct manner, and also provides programmers with the practical means to test them on real applications. This particular book, Parts 1-4, represents the essential first half of Sedgewick's complete work. Its four parts are fundamentals, data structures, sorting, and searching. It has expanded coverage of arrays, linked lists, strings, trees, ADT's, and object-oriented programming.
Table of Contents
I. FUNDAMENTALS.
2. Principles of Algorithm Analysis.
II. DATA STRUCTURES.
4. Abstract Data Types.
5. Recursion and Trees.
III. SORTING.
7. Quicksort 315.
8. Merging and Mergesort.
9. Priority Queues and Heapsort.
10. Radix Sorting.
11. Special-Purpose Sorts.
IV. SEARCHING.
13. Balanced Trees.
14. Hashing.
15. Radix Search.
16. External Searching.
Appendix.