Data Structures and Algorithms in JavaScript

by Federico Kereki

December 2024, 495 pp.

ISBN-13:

9781718502628

For Javascript developers, this book is a one-stop shop for learning the algorithms and data structures that solve and optimize complex problems. Covering everything from functional programming and abstract data types, to sorting and searching, lists, bags, binary trees, forests, heaps, and graphs—the author uses examples taken from coding challenges and interview questions, enabling readers to explore the real-world advantages of specific algorithms and data structures.

Written and illustrated to be a developer’s go-to reference manual as well as for immediate on-the-job applications, performance—both from a theoretical point of view and a practical standpoint—is considered alongside every algorithm or data structure introduced. In addition to demonstrating best practices throughout the text, each chapter ends with a series of questions that amplify the preceding concepts and provide further examples for the reader to apply. Also of note, the book utilizes the latest version of JavaScript (ECMAScript) and its more modern features wherever appropriate.

Author Bio

Federico Kereki is a Computer Systems Engineer with an M.Sc. in Education. He has over 30 years’ experience as consultant, system developer, university professor, and writer. Currently, he is a subject matter expert at Globant, where he gets to use a mixture of development frameworks, programming tools, and operating systems, such as JavaScript; Node.js; React, Vue, Svelte, Angular, Docker and containers, and SOA. Has given talks on several programming topics, such as functional programming, agile methodologies, and data structures. He has taught several courses at the Universidad de la República, Universidad ORT, and Universidad de la Empresa, and he lives in Montevideo, Uruguay.

Table of contents

Preface
Introduction
PART I: THE BASICS
Chapter 1:The JavaScript Language and Development tools
Chapter 2: Functional Programming in JavaScript
Chapter 3: Abstract Data Types
Chapter 4:Analyzing Algorithms

PART II: ALGORITHMS
Chapter 5: Designing Algorithms
Chapter 6: Sorting
Chapter 7: Selecting
Chapter 8: Shuffling and Sampling
Chapter 9: Searching

PART III: DATA STRUCTURES
Chapter 10: Lists
Chapter 11: Bags, sets, and maps
Chapter 12: Binary Trees
Chapter 13: Trees and Forests
Chapter 14: Heaps
Chapter 15: Extended Heaps
Chapter 16: Digital Search Trees
Chapter 17: Graphs
Chapter 18: Immutability and Functional Data Structures
Answer Key
Bibliography
Index

The chapters in red are included in this Early Access PDF.

Reviews

"[A]n incredibly useful resource for those of us who did not have a formal computer science background or simply never had the time to properly learn formal aspects of programming in general. It's a tough book that will make you work, but worth every bit of effort."
—Raymond Camden, Senior Developer Evangelist for Adobe

"Finally a book about algorithms and data structures that uses JavaScript! Read this if you want to learn important foundational techniques for writing and analyzing code—how to sort data, how to structure data for efficient look-up, and more. While similar to academic textbooks in its comprehensiveness, it's much easier to understand."
—Axel Rauschmayer, JavaScript specialist, author of the 2alilty blog and numerous JavaScript books