Java數(shù)據(jù)結(jié)構(gòu)和算法（第二版·影印版）

定　價(jià)：￥69.80

作　者：	（美）拉佛
出版社：	中國電力出版社
叢編項(xiàng)：
標(biāo)　簽：	算法語言

購買這本書可以去

ISBN：	9787508356440	出版時(shí)間：	2007-06-01	包裝：	平裝
開本：	16開	頁數(shù)：	748	字?jǐn)?shù)：

內(nèi)容簡介

　　這是一本有關(guān)計(jì)算機(jī)編程中所應(yīng)用的數(shù)據(jù)結(jié)構(gòu)和算法的書，以一種易懂的方式教授如何安排和操縱數(shù)據(jù)，其中不乏一些難題，了解這些知識可以使計(jì)算機(jī)的應(yīng)用獲得更好的表現(xiàn)。本書提供了一套獨(dú)創(chuàng)的可視討論專題用以闡明主要的論題，并使用Java語言說明重要的概念，從而避免了C/C++語言的復(fù)雜性，以便集中精力論述數(shù)據(jù)結(jié)構(gòu)和算法。在本書中，作者提供了許多簡單明了的例子，避免了對于這類命題常見的冗長、繁瑣的數(shù)學(xué)證明；在第二版中，還利用Java語言的新特性修改并擴(kuò)充了這些例子。在每章的最后都有問題和練習(xí)，使讀者有機(jī)會測試自己對相關(guān)知識的理解程度。通過學(xué)習(xí)本書，你可以學(xué)會如何為常見和不太常見的編程條件選擇正確的算法；利用數(shù)據(jù)結(jié)構(gòu)和算法為現(xiàn)實(shí)世界的處理過程建模；了解不同的數(shù)據(jù)結(jié)構(gòu)的優(yōu)缺點(diǎn)，考慮如何利用它們改進(jìn)編程的效率；學(xué)會如何用面向?qū)ο蟮木幊毯喕瘮?shù)據(jù)結(jié)構(gòu)和算法。

作者簡介

　　Robert Lafore先生從1982年就開始編寫計(jì)算機(jī)編程方面的書。他的暢銷書有《Object-Oriented Programming in C++》此書在世界上的銷量已經(jīng)超過200000冊，其他還有《Assembly Language for the IBM PC》、《C Programming in Turbo C++》和《C++ Interactive Course》、Lafore先生擁有數(shù)學(xué)和電子工程的學(xué)位，他從PDP-5時(shí)代就開始活躍在編程領(lǐng)域了，那時(shí)能用上一塊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