Take your programming skills to the next level. Learn to build stacks, queues, trees, graphs, and efficient sorting and searching algorithms from scratch. Perhaps you’ve heard about Big O notation, stacks and queues, or bubble sort and quicksort. You’d like to learn more, but it’s hard to find any good examples and explanations that use your favorite programming language, Dart.
Data Structures & Algorithms in Dart is here to help with in-depth explanations, copious illustrations, and step-by-step examples. The book begins by reviewing fundamental data structures like lists and maps and then goes on to teach you how to build other important structures from scratch, including stacks, linked lists, queues, trees and graphs. From there you’ll use these data structures to understand and write many different traversal, searching and sorting algorithms. All along the way, you’ll learn how to analyze the efficiency of your code and express that efficiency using Big O notation.

lgli/Jonathan Sande - Data Structures & Algorithms in Dart.pdf

lgrsnf/Jonathan Sande - Data Structures & Algorithms in Dart.pdf

{"last_page":425,"publisher":"Razeware LLC"}

Book License
What You Need
Book Source Code & Forums
About the Authors
About the Editors
Acknowledgments
Content Development
Introduction
How to Read This Book
Chapter 1: Why Learn Data Structures & Algorithms?
The Goal of This Book
Chapter 2: Complexity
Time Complexity
Space Complexity
Other Notations
Key Points
Chapter 3: Basic Data Structures in Dart
List
Map
Set
Key Points
Where to Go From Here?
Chapter 4: Stacks
Stack Operations
Implementation
Challenges
Key Points
Chapter 5: Linked Lists
Node
LinkedList
Adding Values to a List
Removing Values From a List
Making a List Iterable
Challenges
Key Points
Chapter 6: Queues
Common Operations
Example of a Queue
List-Based Implementation
Doubly Linked List Implementation
Ring Buffer Implementation
Double-Stack Implementation
Challenges
Key Points
Chapter 7: Trees
Terminology
Implementation
Traversal Algorithms
Challenges
Key Points
Chapter 8: Binary Trees
Implementation
Traversal Algorithms
Challenges
Key Points
Chapter 9: Binary Search Trees
List vs. BST
Implementation
Challenges
Key Points
Chapter 10: AVL Trees
Understanding Balance
Implementation
Challenges
Key Points
Where to Go From Here?
Chapter 11: Tries
List vs. Trie
Implementation
Challenges
Key Points
Chapter 12: Binary Search
Linear Search vs. Binary Search
Implementation
Challenges
Key Points
Chapter 13: Heaps
What’s a Heap?
The Heap Property
The Shape Property
Heap Applications
Fitting a Binary Tree Into a List
Implementation
Challenges
Key Points
Chapter 14: Priority Queues
Applications
Common Operations
Implementation
Challenges
Key Points
Chapter 15: O(n2) Sorting Algorithms
Bubble Sort
Selection Sort
Insertion Sort
Stability
Challenges
Key Points
Chapter 16: Merge Sort
Example
Implementation
Performance
Challenges
Key Points
Chapter 17: Radix Sort
Sorting by Least Significant Digit
Sorting by Most Significant Digit
Challenges
Key Points
Chapter 18: Heapsort
Example
Implementation
Performance
Challenges
Key Points
Chapter 19: Quicksort
Example
Naïve Implementation
Partitioning Strategies
Challenges
Key Points
Where to Go From Here?
Chapter 20: Graphs
Types of Graphs
Common Operations
Adjacency List
Adjacency Matrix
Graph Analysis
Challenges
Key Points
Chapter 21: Breadth-First Search
How Breadth-First Search Works
Implementation
Performance
Challenges
Key Points
Chapter 22: Depth-First Search
How Depth-First Search Works
Implementation
Performance
Cycles
Challenges
Key Points
Chapter 23: Dijkstra’s Algorithm
How Dijkstra’s Algorithm Works
Implementation
Performance
Challenges
Key Points
Conclusion
Approaching a Difficult Problem
Learning Tips
Where to Go From Here?
Chapter 4 Solutions
Solution to Challenge 1
Chapter 5 Solutions
Solution to Challenge 1
Solution to Challenge 2
Solution to Challenge 3
Solution to Challenge 4
Chapter 6 Solutions
Solution to Challenge 1
Solution to Challenge 2
Solution to Challenge 3
Solution to Challenge 4
Chapter 7 Solutions
Solution to Challenge 1
Solution to Challenge 2
Chapter 8 Solutions
Solution to Challenge 1
Solution to Challenge 2
Chapter 9 Solutions
Solution to Challenge 1
Solution to Challenge 2
Solution to Challenge 3
Chapter 10 Solutions
Solution to Challenge 1
Solution to Challenge 2
Solution to Challenge 3
Chapter 11 Solutions
Solution to Challenge 1
Solution to Challenge 2
Chapter 12 Solutions
Solution to Challenge 1
Solution to Challenge 2
Solution to Challenge 3
Chapter 13 Solutions
Solution to Challenge 1
Solution to Challenge 2
Solution to Challenge 3
Solution to Challenge 4
Chapter 14 Solutions
Solution to Challenge 1
Solution to Challenge 2
Chapter 15 Solutions
Solution to Challenge 1
Solution to Challenge 2
Solution to Challenge 3
Solution to Challenge 4
Chapter 16 Solutions
Solution to Challenge 1
Solution to Challenge 2
Chapter 17 Solutions
Solution to Challenge 1
Solution to Challenge 2
Solution to Challenge 3
Chapter 18 Solutions
Solution to Challenge 1
Solution to Challenge 2
Chapter 19 Solutions
Solution to Challenge 1
Solution to Challenge 2
Chapter 20 Solutions
Solution to Challenge 1
Chapter 21 Solutions
Solution to Challenge 1
Solution to Challenge 2
Solution to Challenge 3
Chapter 22 Solutions
Solution to Challenge 1
Solution to Challenge 2
Chapter 23 Solutions
Solution to Challenge 1
Solution to Challenge 2

2022-02-23