Preface

Over the past few years, JavaScript has been used more and more as a server-side com‐

puter programming language owing to platforms such as Node.js and SpiderMonkey.

Now that JavaScript programming is moving out of the browser, programmers will find

they need to use many of the tools provided by more conventional languages, such as

C++ and Java. Among these tools are classic data structures such as linked lists, stacks,

queues, and graphs, as well as classic algorithms for sorting and searching data. This

book discusses how to implement these data structures and algorithms for server-side

JavaScript programming.



JavaScript programmers will find this book useful because it discusses how to implement

data structures and algorithms within the constraints that JavaScript places them, such

as arrays that are really objects, overly global variables, and a prototype-based object

system. JavaScript has an unfair reputation as a “bad” programming language, but this

book demonstrates how you can use JavaScript to develop efficient and effective data

structures and algorithms using the language’s “good parts.”





Description



Data Structures and Algorithms with JavaScript

Bringing classic computing approaches to the Web

By Michael McMillan

Publisher: O'Reilly Media

Final Release Date: March 2014

Pages: 250

Format: PDF

Print ISBN:978-1-4493-6493-9 -- ISBN 10:1-4493-6493-4Ebook

ISBN:978-1-4493-6492-2 -- ISBN 10:1-4493-6492-6





Description:

As an experienced JavaScript developer moving to server-side programming, you need to implement classic data structures and algorithms associated with conventional object-oriented languages like C# and Java. This practical guide shows you how to work hands-on with a variety of storage mechanisms—including linked lists, stacks, queues, and graphs—within the constraints of the JavaScript environment.



Determine which data structures and algorithms are most appropriate for the problems you’re trying to solve, and understand the tradeoffs when using them in a JavaScript program. An overview of the JavaScript features used throughout the book is also included.



This book covers:

Arrays and lists: the most common data structures

Stacks and queues: more complex list-like data structures

Linked lists: how they overcome the shortcomings of arrays

Dictionaries: storing data as key-value pairs

Hashing: good for quick insertion and retrieval

Sets: useful for storing unique elements that appear only once

Binary Trees: storing data in a hierarchical manner

Graphs and graph algorithms: ideal for modeling networks

Algorithms: including those that help you sort or search data

Advanced algorithms: dynamic programming and greedy algorithms



-------------------

Keep learning and help us to share the Knowledge across the World.