|
|
|
|
| LEADER |
04054nmm a2200409 u 4500 |
| 001 |
EB001930611 |
| 003 |
EBX01000000000000001093513 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
210123 ||| eng |
| 020 |
|
|
|a 9781783554881
|
| 050 |
|
4 |
|a QA76.73.J39
|
| 100 |
1 |
|
|a Groner, Loiane
|
| 245 |
0 |
0 |
|a Learning JavaScript data structures and algorithms
|b understand and implement classic data structures and algorithms using JavaScript
|c Loiane Groner
|
| 260 |
|
|
|a Birmingham [England]
|b Packt Publishing
|c 2014
|
| 300 |
|
|
|a 218 pages
|
| 505 |
0 |
|
|a Appending elements to the end of the linked listRemoving elements from the linked list; Inserting an element at any position; Implementing other methods; The toString method; The indexOf method; The isEmpty, size, and getHead methods; Doubly linked lists; Inserting a new element at any position; Removing elements from any position; Circular linked lists; Summary; Chapter 6: Sets; Creating a set; The has (value) method; The add method; The remove and clear methods; The size method; The values method; Using the Set class; Set operations; Set union; Set intersection; Set difference; Subset
|
| 505 |
0 |
|
|a Cover; Copyright; Credits; About the Author; Acknowledgments; About the Reviewers; www.PacktPub.com; Table of Contents; Preface; Chapter 1: JavaScript -- A Quick Overview; Setting up the environment; The browser is enough; Using web servers (XAMPP); It's all about JavaScript (Node.js); JavaScript basics; Variables; Variable scope; Operators; Truthy and falsy; The equals operators (== and ===); Control structures; Conditional statements; Loops; Functions; Object-oriented programming; Debugging and tools; Summary; Chapter 2: Arrays; Why should we use arrays?; Creating and initializing arrays
|
| 505 |
0 |
|
|a In-order traversalPre-order traversal; Post-order traversal; Searching for values in a tree; Searching for minimum and maximum values; Searching for a specific value; Removing a node; Removing a leaf node; Removing a node with a left or right child; Removing a node with two children; More about binary trees; Summary; Chapter 9: Graphs; Graph terminology; Directed and undirected graphs; Representing a graph; Adjacency matrix; Adjacency list; Incidence matrix; Creating the Graph class; Graph traversals; Breadth-first search (BFS); Finding the shortest paths using BFS
|
| 505 |
0 |
|
|a Adding and removing elementsTwo-dimensional and multi-dimensional arrays; Reference for JavaScript array methods; Joining multiple arrays; Iterator functions; Searching and sorting; Custom sorting; Sorting strings; Searching; Outputting the array into a string; Summary; Chapter 3: Stacks; Creating a stack; The complete Stack class; Using the Stack class; Decimal to binary; Summary; Chapter 4: Queues; Creating a queue; The complete Queue class; Using the Queue class; Priority queue; Circular queue -- Hot Potato; Summary; Chapter 5: Linked Lists; Creating a linked list
|
| 653 |
|
|
|a JavaScript (Computer program language) / http://id.loc.gov/authorities/subjects/sh96004880
|
| 653 |
|
|
|a COMPUTERS / Software Development & Engineering / Tools / bisacsh
|
| 653 |
|
|
|a JavaScript (Langage de programmation)
|
| 653 |
|
|
|a JavaScript (Computer program language) / fast
|
| 653 |
|
|
|a COMPUTERS / Software Development & Engineering / General / bisacsh
|
| 653 |
|
|
|a COMPUTERS / Programming / Open Source / bisacsh
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b OREILLY
|a O'Reilly
|
| 490 |
0 |
|
|a Open source. Community experience distilled
|
| 776 |
|
|
|z 1783554886
|
| 776 |
|
|
|z 9781783554874
|
| 776 |
|
|
|z 9781783554881
|
| 776 |
|
|
|z 1783554878
|
| 856 |
4 |
0 |
|u https://learning.oreilly.com/library/view/~/9781783554874/?ar
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 005.2/762
|
| 082 |
0 |
|
|a 620
|
| 520 |
|
|
|a If you are a JavaScript developer or someone who has basic knowledge of JavaScript, and want to explore its optimum ability, this fast-paced book is definitely for you. Programming logic is the only thing you need to know to start having fun with algorithms
|