- Login via:
- vk.com
- ok.ru
- google.com
- mail.ru
- yandex.ru
Lau Kelvin, Ngo Vincent. Data Structures & Algorithms in Swift: Implementing practical data structures with Swift 4.2
- pdf file
- size 16,58 MB
- added by bookman_72
- info modified
2nd Edition. — Razeware LLC, 2019. — 400 p.The most popular and comprehensive book on Swift algorithms & data structures!
This 23-chapter book covers search (breadth-first, depth-first, Dijkstra’s), sort (mergesort, radix sort, heap sort, and quicksort), trees (binary trees, AVL trees, binary search trees), stacks, graphs, and more.Learn how to implement the most common and useful data structures and algorithms in Swift! Understanding how data structures and algorithms work in code is crucial for creating efficient and scalable apps. Swift’s Standard Library has a small set of general purpose collection types, yet they definitely don’t cover every case!
This 23-chapter book covers search (breadth-first, depth-first, Dijkstra’s), sort (mergesort, radix sort, heap sort, and quicksort), trees (binary trees, AVL trees, binary search trees), stacks, graphs, and more.Learn how to implement the most common and useful data structures and algorithms in Swift! Understanding how data structures and algorithms work in code is crucial for creating efficient and scalable apps. Swift’s Standard Library has a small set of general purpose collection types, yet they definitely don’t cover every case!
- Sign up or login using form at top of the page to download this file.