Data Structures & Algorithms in Dart

Data Structures & Algorithms in Dart


Up to date for Dart 2.15

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.

Who is this book for

This book is for programmers who are familiar with the Dart language but would like to improve the efficiency of their code and take their skills to the next level.

Concepts covered in this book

  • Big O Notation
  • Dart Lists, Sets and Maps
  • Stacks
  • Linked Lists
  • Doubly Linked Lists
  • Queues
  • Ring Buffers
  • Binary Trees
  • AVL Trees
  • Tries
  • Heaps
  • Priority Queues
  • Graphs
  • Binary Search
  • Breadth-First Search
  • Depth-First Search
  • Bubble Sort
  • Selection Sort
  • Insertion Sort
  • Merge Sort
  • Radix Sort
  • Heapsort
  • Quicksort
  • Dijkstra’s Algorithm


Unity Apprentice

2022-4-28 17:36:40


Metal by Tutorials, 3rd Edition

2022-4-28 17:58:46