| 通过由基于Java的演示程序所组成的可视专题讨论来掌握数据结构和算法. 学会如何为常见和不太常见的编程条件选择正确的算法.. 利用擞据结构和算法为现实世界的处理过程建模 了解不同数据结构和优势和弱点，考虑如何利用它们改进编程效率 学会如何通过面向对象的编程简化数据结构和算法... |
| Robert Lafore先生从1982年就开始编写计算机编程方面的书。他的畅销书有《Object-Oriented Programming in C++》此书在世界上的销量已经超过200000册，其他还有《Assembly Language for the IBM PC》、《C Programming in Turbo C++》和《C++ Interactive Course》、Lafore先生拥有数学和电子工程的学位，他从PDP-5时代就开始活跃在编程领域了，那时能用上一块4K的主存都是难得的。 .. << 查看详细 |
| introduction what’s new in the second edition additional topics end-of-chapter questions experiments programming projects what this book is about what’s different about this book easy to understand workshop applets java example code who this bookis for what you need to know before you read this book the software you need to use this book how this book is organized enjoy yourself! 1 overvlew what are data structures and algorithms good for? real-world data storage programmer’s tools . real-world modeling overview of data structures overview of algorithms some definitions database record field key object-oriented programming problems with procedural languages objects in a nutshell a runnable object-oriented program inheritance and polymorphism software engineering java for c++programmers no pointers overloaded operators primitive variable types input／output java library data structures summary questions 2 arrays the array workshop applet insertion searching deletion the duplicates issue nottbo swift the basics of arrays in iava creating an array accessing array elements initialization an array example dividing a program into classes classes lowarray and lowarrayapp class interfaces not so convenient who’s responsible for what? the higharray．j ava example the user’s life made easier abstraction the ordered workshop applet linear search binary search java code for an ordered array binary search with the find()method the ordarray class advantages of ordered arrays logarithms the equation the opposite of raising two to a power …… 3 simple sorting 4 stacks and queues 5 linked lists 6 recursion 7 advanced sorting 8 binary trees 9 red-black trees 10 2-3-4 trees and external storage 11 hash tables 12 heaps 13 graphs 14 weighted graphs 15 when to use what appendixes a running the workshop applets and example programs b further reading c answers to questions |
内容加载中，请稍后...
商品评论（0条）