Not filled with with obtuse mathematics and difficult proofs, MWSS:Data Structures and Algorithms in Java removes the mystique from DS&A. It does this in two ways. First, the text is written in a straightforward style, making it accessible to anyone. Second, unique new Java demonstration programs,
Data Structures & Algorithms in Java
โ Scribed by Mitchell Waite, Robert Lafore
- Publisher
- Waite Group Press
- Year
- 1998
- Tongue
- English
- Leaves
- 526
- Series
- Mitchell Waite signature series
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
Book was in great condition..but unfortunately it did not come with the accompanying cd ! It's virtually impossible to simulate all these algorithms without the applets(on the cd!).
โฆ Table of Contents
Cover......Page 1
Contents......Page 3
1. Overview......Page 11
2. Arrays (FLAW)......Page 29
3. Simple Sorting......Page 63
4. Stacks and Queues......Page 89
5. Linked Lists......Page 142
6. Recursion (FLAW)......Page 200
7. Advanced Sorting......Page 243
8. Binary Trees......Page 280
9. Red-Black Trees......Page 311
10. Other Trees......Page 335
11. Hash Tables......Page 372
12. Heaps......Page 416
13. Graphs......Page 438
14. Weighted Graphs......Page 476
15. When to Use What......Page 510
A: Running Programs......Page 521
B: Further Reading......Page 524
๐ SIMILAR VOLUMES
Not filled with with obtuse mathematics and difficult proofs, MWSS:Data Structures and Algorithms in Java removes the mystique from DS&A. It does this in two ways. First, the text is written in a straightforward style, making it accessible to anyone. Second, unique new Java demonstration programs,
Not filled with with obtuse mathematics and difficult proofs, MWSS:Data Structures and Algorithms in Java removes the mystique from DS&A. It does this in two ways. First, the text is written in a straightforward style, making it accessible to anyone. Second, unique new Java demonstration programs,
Not filled with with obtuse mathematics and difficult proofs, MWSS:Data Structures and Algorithms in Java removes the mystique from DS&A. It does this in two ways. First, the text is written in a straightforward style, making it accessible to anyone. Second, unique new Java demonstration programs, c