JavaScript中的数据结构与算法 英文2025|PDF|Epub|mobi|kindle电子书版本百度云盘下载

JavaScript中的数据结构与算法 英文PDF格式电子书版下载

注意：本站所有压缩包均有解压码： 点击下载压缩包解压工具

1．The JavaScript Programming Environment and Model1

The JavaScript Environment1

JavaScript Programming Practices2

Declaring and Initializing Variables3

Arithmetic and Math Library Functions in JavaScript3

Decision Constructs4

Repetition Constructs6

Functions7

Variable Scope8

Recursion10

Objects and Object-Oriented Programming11

Summary12

2．Arrays13

JavaScript Arrays Defined13

Using Arrays14

Creating Arrays14

Accessing and Writing Array Elements15

Creating Arrays from Strings15

Aggregate Array Operations16

Accessor Functions17

Searching for a Value18

String Representations of Arrays18

Creating New Arrays from Existing Arrays19

Mutator Functions20

Adding Elements to an Array20

Removing Elements from an Array21

Adding and Removing Elements from the Middle of an Array21

Putting Array Elements in Order22

Iterator Functions23

Non-Array-Generating Iterator Functions23

Iterator Functions That Return a New Array26

Two-Dimensional and Multidimensional Arrays27

Creating Two-Dimensional Arrays28

Processing Two-Dimensional Array Elements28

Jagged Arrays30

Arrays of Objects31

Arrays in Objects32

Exercises33

3．Lists35

A List ADT35

A List Class Implementation36

Append:Adding an Element to a List37

Remove:Removing an Element from a List37

Find:Finding an Element in a List38

Length:Determining the Number of Elements in a List38

toString:Retrieving a List's Elements38

Insert:Inserting an Element into a List39

Clear:Removing All Elements from a List39

Contains:Determining if a Given Value Is in a List40

Moving To and Retrieving a List Element40

Iterating Through a List40

Iterating Through a List42

A List-Based Application43

Reading Text Files43

Using Lists to Manage a Kiosk44

Exercises47

4．Stacks49

Stack Operations49

A Stack Implementation50

Using the Stack Class53

Multiple Base Conversions53

Palindromes54

Demonstrating Recursion56

Exercises57

5．Queues59

Queue Operations59

An Array-Based Queue Class Implementation60

Using the Queue Class:Assigning Partners at a Square Dance63

Sorting Data with Queues67

Priority Queues70

Exercises73

6．Linked Lists75

Shortcomings of Arrays75

Linked Lists Defined76

An Object-Based Linked List Design77

The Node Class77

The Linked List Class78

Inserting New Nodes78

Removing Nodes from a Linked List80

Doubly Linked Lists83

Circularly Linked Lists87

Other Linked List Functions88

Exercises88

7．Dictionaries91

The Dictionary Class91

Auxiliary Functions for the Dictionary Class93

Adding Sorting to the Dictionary Class95

Exercises96

8．Hashing99

An Overview of Hashing99

A Hash Table Class100

Choosing a Hash Function100

A Better Hash Function103

Hashing Integer Keys105

Storing and Retrieving Data in a Hash Table108

Handling Collisions109

Separate Chaining109

Linear Probing112

Exercises113

9．Sets115

Fundamental Set Definitions,Operations,and Properties115

Set Definitions115

Set Operations116

The Set Class Implementation116

More Set Operations118

Exercises122

10．Binary Trees and Binary Search Trees123

Trees Defined123

Binary Trees and Binary Search Trees125

Building a Binary Search Tree Implementation126

Traversing a Binary Search Tree128

BST Searches131

Searching for the Minimum and Maximum Value132

Searching for a Specific Value133

Removing Nodes from a BST134

Counting Occurrences136

Exercises139

11．Graphs and Graph Algorithms141

Graph Definitions141

Real-World Systems Modeled by Graphs143

The Graph Class143

Representing Edges143

Building a Graph144

Searching a Graph146

Depth-First Search146

Breadth-First Search148

Finding the Shortest Path150

Breadth-First Search Leads to Shortest Paths150

Determining Paths151

Topological Sorting152

An Algorithm for Topological Sorting153

Implementing the Topological Sorting Algorithm153

Exercises158

12．Sorting Algorithms159

An Array Test Bed159

Generating Random Data161

Basic Sorting Algorithms161

Bubble Sort162

Selection Sort165

Insertion Sort167

Timing Comparisons of the Basic Sorting Algorithms168

Advanced Sorting Algorithms171

The Shellsort Algorithm171

The Mergesort Algorithm176

The Quicksort Algorithm181

Exercises186

13．Searching Algorithms187

Commonly Used Functions in Examples187

Searching for Minimum and Maximum Values190

Using Self-Organizing Data193

Binary Search197

Counting Occurrences201

Searching Textual Data204

Exercises207

14．Advanced Algorithms209

Dynamic Programming209

A Dynamic Programming Example:Computing Fibonacci Numbers210

Finding the Longest Common Substring213

The Knapsack Problem:A Recursive Solution216

The Knapsack Problem:A Dynamic Programming Solution217

Greedy Algorithms219

A First Greedy Algorithm Example:The Coin-Changing Problem219

A Greedy Algorithm Solution to the Knapsack Problem220

Exercises222

Index225