Data Structures & Algorithms in Java, 2/e (Hardcover)
貴賓價: $1,188Discrete and Combinatorial Mathematics: An Applied Introduction, 5/e (IE-Paperback)
貴賓價: $1,140Database Management Systems, 3/e (IE-Paperback)
貴賓價: $970Introduction to Algorithms, 2/e
貴賓價: $1,166Computer Networking: A Top-Down Approach, 5/e (IE-Paperback)
貴賓價: $1,188Algorithms in Java, (Parts 1-5), 3/e (Paperback)
貴賓價: $1,083Java How to Program, 6/e (IE)(美國版ISBN:0131483986)
貴賓價: $760Java How to Program, 9/e (IE-Paperback)
貴賓價: $1,362Data-Intensive Text Processing with MapReduce (Paperback)
售價: $1,056HBase in Action (Paperback)
售價: $1,400A Practical Guide to Linux Commands, Editors, and Shell Programming, 3/e (Paperback)
貴賓價: $1,474Hadoop in Action (Paperback)
貴賓價: $1,254Write Great Code: Understanding the Machine (Paperback)
貴賓價: $1,222Ruminations on C++: A Decade of Programming Insight and Experience (Paperback)
貴賓價: $1,103Learning the vi and Vim Editors, 7/e (Paperback)
貴賓價: $1,995C Primer Plus, 6/e (Paperback)
貴賓價: $1,666LTE and the Evolution to 4G Wireless: Design and Measurement Challenges, 2/e (Hardcover)
貴賓價: $1,330Mining the Social Web: Analyzing Data from Facebook, Twitter, LinkedIn, and Other Social Media Sites (Paperback)
售價: $620Game Programming The L Line, The Express Line to Learning (Paperack)
Data Structures and Algorithms in Java, Second Edition is designed to be easy to read and understand although the topic itself is complicated. Algorithms are the procedures that software programs use to manipulate data structures. Besides clear and simple example programs, the author includes a workshop as a small demonstration program executable on a Web browser. The programs demonstrate in graphical form what data structures look like and how they operate. In the second edition, the program is rewritten to improve operation and clarify the algorithms, the example programs are revised to work with the latest version of the Java JDK, and questions and exercises will be added at the end of each chapter making the book more useful to readers.
Table of Contents
3. Simple Sorting.
4. Stacks and Queues.
5. Linked Lists.
7. Advanced Sorting.
8. Binary Trees.
9. Red-Black Trees.
10. 2-3-4 Trees and External Storage.
11. Hash Tables.
14. Weighted Graphs.
15. When to Use What.
Appendix A. Running the Workshop Applets and Example Programs.
Appendix B. Further Reading.
Appendix C. Answers to Questions.