出版时间:2007-6 出版社:中国电力出版社 作者:拉佛 页数:748
Tag标签:无
内容概要
本书以一种易懂的方式教授如何安排和操纵数据,其中不乏一些难题;了解这些知识以期使计算机的应用获得最佳性能。不管使用何种语言或平台,掌握了数据结构和算法将改进程序的质量和性能。 本书提供了一套独创的可视讨论专题用以阐明主要的论题;它使用Java 语言说明重要的概念,而避免了C/C++语言的复杂性,以便集中精力论述数据结构和算法。 经验丰富的作者Robert Lafore先生提供了许多简单明了的例子。避免了对于这类命题常见的冗长、繁琐的数学证明。在第二版中,他利用Java语言最新特性,修改并扩充了书中的例子。在每一章后都有问题和练习,使读者有机会测试自己的理解程度。
作者简介
Robert Lafore先生从1982年就开始编写计算机编程方面的书。他的畅销书有《Object-Oriented Programming in C++》此书在世界上的销量已经超过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
图书封面
图书标签Tags
无
评论、评分、阅读与下载