Java數(shù)據(jù)結(jié)構(gòu)和算法

內(nèi)容概要

本書以一種易懂的方式教授如何安排和操縱數(shù)據(jù)，其中不乏一些難題；了解這些知識以期使計算機的應(yīng)用獲得最佳性能。不管使用何種語言或平臺，掌握了數(shù)據(jù)結(jié)構(gòu)和算法將改進程序的質(zhì)量和性能?！　”緯峁┝艘惶转殑?chuàng)的可視討論專題用以闡明主要的論題；它使用Java 語言說明重要的概念，而避免了C/C++語言的復(fù)雜性，以便集中精力論述數(shù)據(jù)結(jié)構(gòu)和算法?！　〗?jīng)驗豐富的作者Robert Lafore先生提供了許多簡單明了的例子。避免了對于這類命題常見的冗長、繁瑣的數(shù)學(xué)證明。在第二版中，他利用Java語言最新特性，修改并擴充了書中的例子。在每一章后都有問題和練習(xí)，使讀者有機會測試自己的理解程度。

作者簡介

Robert Lafore先生從1982年就開始編寫計算機編程方面的書。他的暢銷書有《Object-Oriented Programming in C++》此書在世界上的銷量已經(jīng)超過200000冊，其他還有《Assembly Language for the IBM PC》、《C Programming in Turbo C++》和《C++ Interactive Course》、Lafo

書籍目錄

IntroductionWhat’S New in the Second Edition  Additional Topics  End-of-Chapter Questions  Experiments  Programming ProjectsWhat This Book Is AboutWhat’S Different About This Book  Easy tO Understand  Workshop Applets  Java Example CodeWho This BookIs ForWhat YoU Need to Know Before You Read This BookThe Software You Need to Use This BookHow This Book Is OrganizedEnjoy 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  Questions2 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 Sorting4 Stacks and Queues5 Linked Lists6 Recursion7 Advanced Sorting8 Binary Trees9 Red-Black Trees10 2-3-4 Trees and External Storage11 Hash Tables12 Heaps13 Graphs14 Weighted Graphs15 When to Use WhatAppendixesA Running the Workshop Applets and Example ProgramsB Further ReadingC Answers to Questions

圖書封面

圖書標(biāo)簽Tags

無

評論、評分、閱讀與下載

---

    Java數(shù)據(jù)結(jié)構(gòu)和算法 PDF格式下載

---