Absolute Beginner's Guide to Algorithms: A Practical Introduction to Data Structures and Algorithms in JavaScript

Auteur

Kirupa Chinnathambi has spent most of his life teaching others to love web development as much as he does. He founded KIRUPA, one of the Web's most popular free web development education resources, serving 210,000+ registered members. Now a product manager at Google, he has authored several books, including Learning React (2017). He holds a B.S. in computer science from MIT.

Texte du rabat

A hands-on, easy-to-comprehend guide that is perfect for anyone who needs to understand algorithms.

With the explosive growth in the amount of data and the diversity of computing applications, efficient algorithms are needed now more than ever. Programming languages come and go, but the core of programming--algorithms and data structures--remains the same.

Absolute Beginner's Guide to Algorithms **is the fastest way to learn algorithms and data structures. Using helpful diagrams and fully annotated code samples in Javascript, you will start with the basics and gradually go deeper and broader into all the techniques you need to organize your data.

• Start fast with data structures basics: arrays, stacks, queues, trees, heaps, and more
• Walk through popular search, sort, and graph algorithms
• Understand Big-O notation and why some algorithms are fast and why others are slow
• Balance theory with practice by playing with the fully functional JavaScript implementations of all covered data structures and algorithms
  

Register your book for convenient access to downloads, updates, and/or corrections as they become available. See inside book for details.

Contenu

Part I: Data Structures

Chapter 1. Introduction to Data Structures .................................................................. 1

Right Tool for the Right Job .................................................................................... 2

Back to Data Structures ........................................................................................... 5

Conclusion ................................................................................................................. 6

Chapter 2. Big-O Notation and Complexity Analysis ................................................... 7

It's Example Time ...................................................................................................... 8

It's Big-O Notation Time! .......................................................................................11

Conclusion ...............................................................................................................15

Chapter 3. Arrays ....................................................................................................... 17

What Is an Array? ....................................................................................................18

Array Implementation / Use Cases .......................................................................24

Arrays and Memory ................................................................................................26

Performance Considerations .................................................................................30

Conclusion ...............................................................................................................32

Chapter 4. Linked Lists ............................................................................................... 35

Meet the Linked List ...............................................................................................36

Linked List: Time and Space Complexity .............................................................40

Linked List Variations ..............................................................................................41

Implementation .......................................................................................................44

Conclusion ...............................................................................................................52

Chapter 5. Stacks ........................................................................................................ 53

Meet the Stack ........................................................................................................54

A JavaScript Implementation ................................................................................56

Stacks: Time and Space Complexity ....................................................................58

Conclusion ...............................................................................................................59

Chapter 6. Queues ..................................................................................................... 61

Meet the Queue .....................................................................................................62

A JavaScript Implementation ................................................................................64

Queues: Time and Space Complexity ..................................................................66

Conclusion ...............................................................................................................67

Chapter 7. Trees ......................................................................................................... 69

Trees 101 .................................................................................................................70

Height and Depth ...................................................................................................75

Conclusion ...............................................................................................................77

Chapter 8. Binary Trees .............................................................................................. 79

Meet the Binary Tree ..............................................................................................80

A Simple Binary Tree Implementation ..................................................................86

Conclusion ...............................................................................................................89

Chapter 9. Binary Search Trees ................................................................................... 91

It's Just a Data Structure ........................................................................................93

Implementing a Binary Search Tree ....................................................................103

Performance and Memory Characteristics .........................................................110

Conclusion .............................................................................................................112

Chapter 10. Heaps ................................…