<h1 class="pgc-h-arrow-right" data-track="1" > book introduction</h1>
Learn JavaScript data structures and algorithms
Author: [Brazil] Loiane Groner
Publisher: People's Post and Telecommunications Publishing House
Original name: Learning JavaScript Data Structures and Algorithms
Translators: Sun Xiaobo / Deng Gang / Wu Shuang / Chen Di / Yuan Yuan
Publication year: 2015-10-1
Number of pages: 159
Pricing: $39.00
Binding: Paperback
Book Series: Turing Programming Series · Web Development Series
ISBN: 9787115404145
<h1 class="pgc-h-arrow-right" data-track="3" > acquisition method</h1>
Pay attention to the WeChat public number: Shen Lin, send: 0948
<h1 class="pgc-h-arrow-right" data-track="5" > table of contents· · · ·</h1>
Chapter 1 Introduction to JavaScript 1
1.1 Environment Setup 1
1.1.1 Browser 2
1.1.2 Using a Web Server (XAMPP) 3
1.1.3 Using Node .js to set up a web server 4
1.2 JavaScript Basics 6
1.2.1 Variable 7
1.2.2 Operator 8
1.2.3 True and false values 11
1.2.4 Equality operators (==and ===) 12
1.3 Control structure 13
1.3.1 Conditional statement 14
1.3.2 Loop 15
1.4 Function 16
1.5 Object-Oriented Programming 16
1.6 Debugging Tools 18
1.7 Summary 18
Chapter 2 Arrays 19
2.1 Why use array 19
2.2 Creating and initializing array 20
2.3 Adding and Removing Elements 21
2.4 Two-dimensional and multidimensional arrays 24
2.5 JavaScript array method reference 26
2.5.1 Array merge 27
2.5.2 Iterator functions 27
2.5.3 Search and sort 28
2.5.4 Output array as string 31
2.6 Summary 32
Chapter 3 Stack 33
3.1 Stack Creation 33
3.2 From decimal to binary 38
3.3 Summary 39
Chapter 4 Queue 40
4.1 Create Queue 40
4.1.1 Complete Queue class 42
4.1.2 Using The Queue class 43
4.2 Priority Queue 44
4.3 Loop queue - Drumming 46
4.4 Summary 47
Chapter 5 Linked List 48
5.1 Create a linked list 49
5.1.1 Append element 50 to the tail of the linked list
5.1.2 Remove element 52 from the linked list
5.1.3 Insert an element 54 anywhere
5.1.4 Implementing other methods 56
5.2 Doubly Linked List 58
5.2.1 Insert a new element 59 anywhere
5.2.2 Remove element 61 from anywhere
5.3 Cyclic Linked List 64
5.4 Summary 64
Chapter 6 Collection 65
6.1 Create a collection 65
6.1.1 has(value) method 66
6.1.2 add method 66
6.1.3 remove and clear methods 67
6.1.4 size method 68
6.1.5 values method 69
6.1.6 Using Set Class 69
6.2 Collection Operation 70
6.2.1 Union 70
6.2.2 Intersection 71
6.2.3 Difference 72
6.2.4 Subset 73
6.3 Summary 74
Chapter 7 Dictionaries and Hash Tables 75
7.1 Dictionary 75
7.1.1 Create a dictionary 75
7.1.2 Using the Dictionary class 78
7.2 Hash table 79
7.2.1 Creating a Hash Table 79
7.2.2 Using HashTable Class 81
7.2.3 Hash lists and hash sets 82
7.2.4 Handling conflicts in hash tables 82
7.2.5 Create a better hash function 90
7.3 Summary 91
Chapter 8 Tree 92
8.1 Related terms for trees 92
8.2 Binary Trees and Binary Search Trees 93
8.2.1 Create binarySearchTree class 94
8.2.2 Insert a key 95 into the tree
8.3 Tree traversal 98
8.3.1 Intermediate traversal 98
8.3.2 Pre-traversal 99
8.3.3 Post-order traversal 100
8.4 Search for the value 101 in the tree
8.4.1 Search for minimum and maximum values of 101
8.4.2 Search for a specific value of 103
8.4.3 Removing a Node 104
8.5 More about binary trees 108
8.6 Summary 109
Chapter 9 Figure 110
9.1 Related terms for figures 110
9.2 Representation of the figure 112
9.2.1 Adjacency matrix 112
9.2.2 Adjacency Table 113
9.2.3 Association matrix 114
9.3 Creating Diagram Class 114
9.4 Figure traversal 116
9.4.1 Breadth Priority Search 117
9.4.2 Depth-first search 122
9.5 Summary 128
Chapter 10 Sorting and Search Algorithms 129
10.1 Sorting Algorithm 129
10.1.1 Bubbling sort 130
10.1.2 Select Sort 133
10.1.3 Insert Sort 134
10.1.4 Merge Sort 135
10.1.5 Quicksort 138
10.2 Search Algorithm 142
10.2.1 Sequential Search 143
10.2.2 Binary search 143
10.3 Summary 145
Chapter 11 Algorithm Supplemental Knowledge 146
11.1 Recursive146
11.1.1 JavaScript call stack size
Limit 147
11.1.2 Fibonacci sequence 147
11.2 Dynamic Programming 149
11.3 Greedy Algorithm 152
11.4 Big O notation 153
11.4.1 Understanding big O notation 153
11.4.2 Time complexity comparison 155
11.5 Entertaining the body and mind with algorithms 156
11.6 Summary 157
Appendix A Time Complexity Cheat Sheet 158
Acknowledgements 160