9781950325573-1950325571-Data Structures & Algorithms in Dart (First Edition): Implementing Practical Data Structures in Dart

Data Structures & Algorithms in Dart (First Edition): Implementing Practical Data Structures in Dart

ISBN-13: 9781950325573
ISBN-10: 1950325571
Author: raywenderlich Tutorial Team, Vincent Ngo, Jonathan Sande, Kelvin Lau
Publication date: 2022
Publisher: Razeware LLC
Format: Paperback 458 pages
FREE US shipping

Book details

ISBN-13: 9781950325573
ISBN-10: 1950325571
Author: raywenderlich Tutorial Team, Vincent Ngo, Jonathan Sande, Kelvin Lau
Publication date: 2022
Publisher: Razeware LLC
Format: Paperback 458 pages

Summary

Data Structures & Algorithms in Dart (First Edition): Implementing Practical Data Structures in Dart (ISBN-13: 9781950325573 and ISBN-10: 1950325571), written by authors raywenderlich Tutorial Team, Vincent Ngo, Jonathan Sande, Kelvin Lau, was published by Razeware LLC in 2022. With an overall rating of 4.4 stars, it's a notable title among other Algorithms (Programming, Mobile Apps) books. You can easily purchase or rent Data Structures & Algorithms in Dart (First Edition): Implementing Practical Data Structures in Dart (Paperback) from BooksRun, along with many other new and used Algorithms books and textbooks. And, if you're looking to sell your copy, our current buyback offer is $1.03.

Description

Learn Data Structures and AlgorithmsPerhaps 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 written with Dart!Who This Book Is ForThis 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.Topics Covered in Data Structures & Algorithms in DartBig O Notation: Analyze the time and space complexity of algorithms.Basic data structures: Efficiently use the lists, sets and maps that come with Dart.Stacks: Build this first-in-last-out data structure from scratch.Queues: Implement this first-in-first-out data structure in multiple ways.Trees: Recursively traverse the nodes of trees that you build yourself.Graphs: Model real-world relationships by connecting data in a network of vertices.Search algorithms: Find values in a collection using binary search, breadth-first search and depth-first search.Sorting algorithms: Learn the differences between bubble sort, radix sort, merge sort and quicksort.One thing you can count on: after reading this book, you'll be prepared to analyze the efficiency of your code and have the tools to improve its performance.

Rate this book Rate this book

We would LOVE it if you could help us and other readers by reviewing the book