经典原版书库·数据结构与算法分析：Java语言描述（英文版·第3版） [Data Structures and Algorithm Analysis in JAVA Third Edition] pdf epub mobi txt 电子书 下载 2025

简体网页||繁体网页

☆☆☆☆☆

[美] Mark Allen Weiss 著

承接 住宅 自建房 室内改造 装修设计 免费咨询 QQ：624617358 一级注册建筑师 亲自为您回答、经验丰富，价格亲民。无论项目大小，都全力服务。期待合作，欢迎咨询！QQ：624617358

出版社： 机械工业出版社

ISBN：9787111412366

版次：1

商品编码：11186951

品牌：机工出版

包装：平装

丛书名： 经典原版书库

外文名称：Data Structures and Algorithm Analysis in JAVA Third Edition

开本：16开

出版时间：2013-02-01

用纸：胶

内容简介

　　《经典原版书库·数据结构与算法分析：Java语言描述（英文版·第3版）》是国外数据结构与算法分析方面的经典教材，使用卓越的Java编程语言作为实现工具讨论了数据结构（组织大量数据的方法）和算法分析（对算法运行时间的估计）。
　　随着计算机速度的不断增加和功能的日益强大，人们对有效编程和算法分析的要求也不断增长。《经典原版书库·数据结构与算法分析：Java语言描述（英文版·第3版）》将算法分析与最有效率的Java程序的开发有机地结合起来，深入分析每种算法，并细致讲解精心构造程序的方法，内容全面、缜密严格。

作者简介

　　Mark Allen Weiss，佛罗里达国际大学计算与信息科学学院教授、副院长，本科教育主任和研究生教育主任。他于1987年获得普林斯顿大学计算机科学博士学位，师从BobSedgewick。他曾经担任全美AP（Advanced Placement）考试计算机学科委员会的主席（2000-2004）。他的主要研究兴趣是数据结构、算法和教育学。

内页插图

目录

Preface
Chapter 1 Introduction
1.1 What's the Book About?
1.2 Mathematics Review
1.2.1 Exponents
1.2.2 Logarichms
1.2.3 Series
1.2.4 Modular Arithmetic
1.2.5 The P Word
1.3 A Brief Inroduction to Recursion
1.4 Implementing Generic Components Pre-Java
1.4.1 Using Object for Genericicy
1.4.2 Wrappers for Primitive Types
1.4.3 Usinglnterface Types for Genericity
1.4.4 Compatibility of Array Types
1.5 Implementing Generic Components Usingjava 5 Generics
1.5.1 Simple Generic Classes and Interfaces
1.5.2 Autoboxing/Unboxing
1.5.3 TheDiamond Operator
1.5.4 Wildcardswith Bounds
1.5.5 Generic Static Methods
1.5.6 Type Bounds
1.5.7 TypeErasure
1.5.8 Restrictions onGenerics
1.6 Function Objects
Summary
Exercises
References

Chapter 2 Algorithm Analysis
2.1 MathematicalBackground
2.2 Model
2.3 What to Analyze
2.4 Running Time Calculations
2.4.1 A Simple Example
2.4.2 General Rules
2.4.3 Solutions for the Maximum Subsequence Sum Problem
2.4.4 Logamhms in the RunningTime
2.4.5 A Grain of Salt
Summary
Exercises
References

Chapter 3 Lists，Stacks，and Queues
3.1 Abstract Data Types （ADTs）
3.2 The List ADT
3.2.1 Simple Array Implementation of Lists
3.2.2 Simple Linked Lists
3.3 Listsin the java Collections API
3.3.1 Collectionlnterfac
3.3.2 Iterator
3.3.3 The List Interface, ArrayList, and LinkedList
3.3.4 Example：UsingremoveonaLinkedList
3.3.5 Listlterators
3.4 Implementation of ArrayList
3.4.1 The Basic Class
3.4.2 The Iterator and Java.Nested and Inner Classes
3.5 Implementation of LinkedList
3.6 The StackADT
3.6.1 Stack Model
……
Chapter 4 Trees
Chapter 5 Hashing
Chapter 6 Priority Queues（Heaps）
Chapter 7 Sorting
Chapter 8 The Disjoint Set Class
Chapter 9 Graph Algorithms
Chapter 10 Algorithm Desing Techniques
Chapter 11 Amortized Analysis
Chapter 12 Advanced Data Sturctures and Implementation
Index

精彩书摘

　　Suppose you have a group of N numbers and would like to determine the thh largest. This is known as the selection problem. Most studencs who have had a programming course or two would have no difficulty writing a program Co solve t.his problem. There are quite a few "obvious" solutions.
　　One way to solve this problem would be to read the N numbers into an array， sort the array in decreasing order by some simple algorithm such as bubblesort， and then return the elemem in poskion k.
　　A somewhat better algorithm might be to read the first k elements into an array and sort them （in decreasing order）. Next， each remaining element is read one by one. As a new element arrives， it is ignored ifit is smaller than the kth element in the array. Otherwise， it is placed in its correct spot in the array， bumping one element out of the array. When the algPo'ithm ends， the element.in the kth position is ret.urned as the answer.
　　Both algorit.hms are simple to code， and you are encouraged to do so. The natural questions， then， are which algorithm is better and， more important， is either algorithm good enough? A simulation using a random file of 30 million elements and k = l5，000，000 will show that neither algorithm finishes in a reasonable amount of time; each requiresseveral days of compurer processing to cerminate （albeic eventually with a correct answer）.An alternative met.hod， discussed in Chapt.er 7， gives a solution in about a second. Thus，although our proposed algorithms work， they cannot be considered good algorithms，because they are entirely impractical for input sizes that a third algorithm can handle in areasonable amount of rime.
　　……

前言/序言

评分☆☆☆☆☆

评分☆☆☆☆☆

很好哈哈哈

评分☆☆☆☆☆

①多向互动，形式多样.互动的课堂，一定的活动的课堂，生活的课堂。互动的条件：平等、自由、宽松、和谐。互动的类型师生互动、生生互动、小组互动、文本互动、习题互动、评价互动。互动的形式：问

评分☆☆☆☆☆

质的要求，对教育规律的把握，对教学艺术的领悟，对教学特色的追求。

评分☆☆☆☆☆

经典原版书库这一系列都挺不错?质量很好而且外表精美，很有看头。

评分☆☆☆☆☆

评分☆☆☆☆☆

一直在京东购书，活动非常多，送货速度也很快，会一直在京东购买。

评分☆☆☆☆☆

⑤教学生抓重点.教学难免有意外，课堂难免有突变，应对教学意外、课堂突变的本领，就是我们通常说的驾驭课堂、驾驭学生的能力。对教师来说，让意外干扰教学、影响教学是无能，把意外变成生成，促进教学、改进教学是艺术。生成相对于教学预设而言，分有意生成、无意生成两种类型；问题生成、疑问生成、答案生成、灵感生成、思维生成、模式生成六种形式。生成的重点在问题生成、灵感生成。教学机智显亮点.随机应变的才智与机敏，最能赢得学生钦佩和行赞叹的亮点。教学机智的类型分为教师教的机智、学生学的机智，师生互动的机智，学生探究的机智。机智常常表现在应对质疑的解答，面对难题的措施，发现问题的敏锐，解决问题的灵活。

评分☆☆☆☆☆

fsadfsdafasdfsad111111fsdafasfsdafasfasf1111fdsafsd111