Learning JavaScript Data Structures and Algorithms: Hone your skills by learning classic data structures and algorithms in JavaScript, Edition 2

· Packt Publishing Ltd
4.3
3 āŠ°āŠŋāŠĩāŦāŠŊāŦ‚
āŠ‡-āŠŠāŦāŠļāŦāŠĪāŠ•
314
āŠŠāŦ‡āМ

āŠ† āŠ‡-āŠŠāŦāŠļāŦāŠĪāŠ• āŠĩāŠŋāŠķāŦ‡

Hone your skills by learning classic data structures and algorithms in JavaScriptKey Features
  • [*] Understand common data structures and the associated algorithms, as well as the context in which they are used.
  • [*] Master existing JavaScript data structures such as array, set and map and learn how to implement new ones such as stacks, linked lists, trees and graphs.
  • [*] All concepts are explained in an easy way, followed by examples.
Book DescriptionThis book begins by covering basics of the JavaScript language and introducing ECMAScript 7, before gradually moving on to the current implementations of ECMAScript 6. You will gain an in-depth knowledge of how hash tables and set data structure functions, as well as how trees and hash maps can be used to search files in a HD or represent a database. This book is an accessible route deeper into JavaScript. Graphs being one of the most complex data structures you’ll encounter, we’ll also give you a better understanding of why and how graphs are largely used in GPS navigation systems in social networks. Toward the end of the book, you’ll discover how all the theories presented by this book can be applied in real-world solutions while working on your own computer networks and Facebook searches. What you will learn
  • [*] Declare, initialize, add, and remove items from arrays, stacks, and queues
  • [*] Get the knack of using algorithms such as DFS (Depth-first Search) and BFS (Breadth-First Search) for the most complex data structures
  • [*] Harness the power of creating linked lists, doubly linked lists, and circular linked lists
  • [*] Store unique elements with hash tables, dictionaries, and sets
  • [*] Use binary trees and binary search trees
  • [*] Sort data structures using a range of algorithms such as bubble sort, insertion sort, and quick sort
Who this book is for

If you are a student of Computer Science or are at the start of your technology career and want to explore JavaScript’s optimum ability, this book is for you. You need a basic knowledge of JavaScript and programming logic to start having fun with algorithms.

āŠĩāŠ§āŦ āŠķāŦ‹āЧāŦ‹

āŠ°āŦ‡āПāŠŋāŠ‚āŠ— āŠ…āŠĻāŦ‡ āŠ°āŠŋāŠĩāŦāŠŊāŦ‚

4.3
3 āŠ°āŠŋāŠĩāŦāŠŊāŦ‚

āŠēāŦ‡āŠ–āŠ• āŠĩāŠŋāŠķāŦ‡

Loiane Groner has over 10 years of experience in developing enterprise applications. Currently, she works as a business analyst and a Java/HTML5/JavaScript developer at an American financial institution. She is passionate about technology, publishes articles on her blog, and has presented talks at conferences about Java, ExtJS, Cordova, Ionic, TypeScript and Angular. She is a Google Developer Expert in Web Technologies and Angular, and a Microsoft Most Valuable Professional in Visual Studio and Development Technologies. She has also authored other Packt books.

āŠ† āŠ‡-āŠŠāŦāŠļāŦāŠĪāŠ•āŠĻāŦ‡ āŠ°āŦ‡āПāŠŋāŠ‚āŠ— āŠ†āŠŠāŦ‹

āŠĪāŠŪāŦ‡ āŠķāŦāŠ‚ āŠĩāŠŋāŠšāŠūāŠ°āŦ‹ āŠ›āŦ‹ āŠ…āŠŪāŠĻāŦ‡ āŠœāŠĢāŠūāŠĩāŦ‹.

āŠŪāŠūāŠđāŠŋāŠĪāŦ€ āŠĩāŠūāŠ‚āŠšāŠĩāŦ€

āŠļāŦāŠŪāŠūāŠ°āŦāПāŠŦāŦ‹āŠĻ āŠ…āŠĻāŦ‡ āŠŸāŦ…āŠŽāŦāŠēāŦ‡āП
Android āŠ…āŠĻāŦ‡ iPad/iPhone āŠŪāŠūāŠŸāŦ‡ Google Play Books āŠāŠŠ āŠ‡āŠĻāŦāŠļāŦāПāŦ‰āŠē āŠ•āŠ°āŦ‹. āŠĪāŦ‡ āŠĪāŠŪāŠūāŠ°āŠū āŠāŠ•āŠūāŠ‰āŠĻāŦāП āŠļāŠūāŠĨāŦ‡ āŠ‘āŠŸāŦ‹āŠŪāŦ…āПāŠŋāŠ• āŠ°āŦ€āŠĪāŦ‡ āŠļāŠŋāŠ‚āŠ• āŠĨāŠūāŠŊ āŠ›āŦ‡ āŠ…āŠĻāŦ‡ āŠĪāŠŪāŠĻāŦ‡ āŠœāŦāŠŊāŠūāŠ‚ āŠŠāŠĢ āŠđāŦ‹ āŠĪāŦāŠŊāŠūāŠ‚ āŠĪāŠŪāŠĻāŦ‡ āŠ‘āŠĻāŠēāŠūāŠ‡āŠĻ āŠ…āŠĨāŠĩāŠū āŠ‘āŠŦāŠēāŠūāŠ‡āŠĻ āŠĩāŠūāŠ‚āŠšāŠĩāŠūāŠĻāŦ€ āŠŪāŠ‚āŠœāŦ‚āаāŦ€ āŠ†āŠŠāŦ‡ āŠ›āŦ‡.
āŠēāŦ…āŠŠāŠŸāŦ‰āŠŠ āŠ…āŠĻāŦ‡ āŠ•āŠŪāŦāŠŠāŦāŠŊāŦāŠŸāŠ°
Google Play āŠŠāŠ° āŠ–āŠ°āŦ€āŠĶāŦ‡āŠē āŠ‘āŠĄāŠŋāŠ“āŠŽāŦāŠ•āŠĻāŦ‡ āŠĪāŠŪāŦ‡ āŠĪāŠŪāŠūāŠ°āŠū āŠ•āŠŪāŦāŠŠāŦāŠŊāŦāŠŸāŠ°āŠĻāŠū āŠĩāŦ‡āŠŽ āŠŽāŦāаāŠūāŠ‰āŠāŠ°āŠĻāŦ‹ āŠ‰āŠŠāŠŊāŦ‹āŠ— āŠ•āŠ°āŦ€āŠĻāŦ‡ āŠļāŠūāŠ‚āŠ­āŠģāŦ€ āŠķāŠ•āŦ‹ āŠ›āŦ‹.
eReaders āŠ…āŠĻāŦ‡ āŠ…āŠĻāŦāŠŊ āŠĄāŠŋāŠĩāŠūāŠ‡āŠļ
Kobo āŠ‡-āŠ°āŦ€āŠĄāŠ° āŠœāŦ‡āŠĩāŠū āŠ‡-āŠ‡āŠ‚āŠ• āŠĄāŠŋāŠĩāŠūāŠ‡āŠļ āŠŠāŠ° āŠĩāŠūāŠ‚āŠšāŠĩāŠū āŠŪāŠūāŠŸāŦ‡, āŠĪāŠŪāŠūāŠ°āŦ‡ āŠŦāŠūāŠ‡āŠēāŠĻāŦ‡ āŠĄāŠūāŠ‰āŠĻāŠēāŦ‹āŠĄ āŠ•āŠ°āŦ€āŠĻāŦ‡ āŠĪāŠŪāŠūāŠ°āŠū āŠĄāŠŋāŠĩāŠūāŠ‡āŠļ āŠŠāŠ° āŠŸāŦāаāŠūāŠĻāŦāŠļāŠŦāŠ° āŠ•āŠ°āŠĩāŠūāŠĻāŦ€ āŠœāŠ°āŦ‚āа āŠŠāŠĄāŠķāŦ‡. āŠļāŠŠāŦ‹āаāŦāПāŦ‡āŠĄ āŠ‡-āŠ°āŦ€āŠĄāŠ° āŠŠāŠ° āŠŦāŠūāŠ‡āŠēāŦ‹ āŠŸāŦāаāŠūāŠĻāŦāŠļāŦāŠŦāŠ° āŠ•āŠ°āŠĩāŠū āŠŪāŠūāŠŸāŦ‡ āŠļāŠđāŠūāŠŊāŠĪāŠū āŠ•āŦ‡āŠĻāŦāŠĶāŦāаāŠĻāŦ€ āŠĩāŠŋāŠ—āŠĪāŠĩāŠūāŠ° āŠļāŦ‚āКāŠĻāŠūāŠ“ āŠ…āŠĻāŦāŠļāŠ°āŦ‹.