Data Structures and Algorithms in JavaScript

Federico Kereki (Autor)

Buch | Softcover

592 Seiten

2025
No Starch Press,US (Verlag)
978-1-7185-0262-8 (ISBN)

Artikel merken

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's use of examples taken from coding challenges and programming interviews enables you to explore the real-world advantages of specific algorithms and data structures. Written and illustrated to be a developer's go-to reference manual for immediate on-the-job applications, performance - both from a theoretical point of view and a practical standpoint - is emphasized alongside every algorithm or data structure introduced. In addition to demonstrating best practices throughout the text, each chapter ends with a series of questions and examples that clarify the preceding concepts. The book utilises the latest version of JavaScript (ECMAScript) and its more modern features wherever appropriate.

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.

Preface
Acknowledgments
Introduction

PART I: THE BASICS
Chapter 1: Using JavaScript
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

Erscheinungsdatum	09.11.2023
Verlagsort	San Francisco
Sprache	englisch
Maße	177 x 234 mm
Themenwelt	Mathematik / Informatik ► Informatik ► Programmiersprachen / -werkzeuge
ISBN-10	1-7185-0262-1 / 1718502621
ISBN-13	978-1-7185-0262-8 / 9781718502628
Zustand	Neuware