Data Structures and Algorithms in JavaScript

Not the Same Old JavaScript.

Think you know JavaScript? Think again. This isn’t your typical coding book—it’s a deep dive into the powerful world of data structures and algorithms that will transform the way you approach problem solving in JavaScript.

Whether you’re a frontend developer tackling complex applications, a backend engineer building scalable systems, or a programmer preparing for technical interviews, this book will revolutionize the way you code.

Key features include:

• Modern JavaScript techniques: Use the latest language features and functional programming principles for cleaner, more efficient code.
• Performance-focused approach: Analyze and optimize algorithms using Big O notation.
• Essential algorithms explained: Implement and fine-tune core algorithms like quicksort, merge sort, digital search, and binary search.
• Algorithm design strategies: Solve challenging problems with techniques like recursion, dynamic programming, backtracking, and brute-force search.
• Advanced data structures: Explore complex structures such as binary search trees, heaps, and graphs.

Each chapter is carefully crafted with clear, no-nonsense explanations of complex concepts, real-world coding examples, and challenging questions (with answers at the end) to reinforce your understanding.

Ready to break free from ordinary JavaScript? Whether your aim is to build cutting-edge web applications, optimize critical systems, or land your dream job, this book equips you with the advanced JavaScript knowledge that sets true experts apart.

Table of Contents

PART I: THE BASICS

Chapter 1: Using JavaScript

Chapter 2: Functional Programming in Java

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

Review

“[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

About the Author

Federico Kereki is a systems engineer with over three decades of experience as a consultant, developer, and educator. Currently a subject matter expert at Globant, he holds a master’s degree in education and has authored several books, including Mastering JavaScript Functional Programming. His work has appeared in Linux Journal, Linux Magazine, IBM DeveloperWorks, and other leading tech publications.