书籍详情
Java数据结构和算法（第二版·影印版）
作者：（美）拉佛
出版社：中国电力出版社
出版时间：2007-06-01
ISBN：9787508356440
定价：¥69.80
购买这本书可以去
内容简介
这是一本有关计算机编程中所应用的数据结构和算法的书，以一种易懂的方式教授如何安排和操纵数据，其中不乏一些难题，了解这些知识可以使计算机的应用获得更好的表现。本书提供了一套独创的可视讨论专题用以阐明主要的论题，并使用Java语言说明重要的概念，从而避免了C/C++语言的复杂性，以便集中精力论述数据结构和算法。在本书中，作者提供了许多简单明了的例子，避免了对于这类命题常见的冗长、繁琐的数学证明；在第二版中，还利用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
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
猜您喜欢
