Название: Data Structures & Algorithms in Swift (3rd Edition)
Автор: Kelvin Lau, Vincent Ngo
Издательство: Razeware LLC
Год: 2019
Страниц: 430
Язык: английский
Формат: pdf (true), epub
Размер: 28.1 MB

The most popular and comprehensive book on Swift algorithms & data structures!
This book covers search (breadth-first, depth-first, Dijkstra’s), sort (merge sort, radix sort, heap sort, and quicksort), trees (binary trees, AVL trees, binary search trees), stacks, graphs, and more.

“As an iOS developer, should I learn about algorithms and data structures?” This question comes up a lot in the online discussion groups that I hang out in. Let me attempt to answer that question by sharing some of my own experiences as a professional developer.
Like many people who got into programming as a hobby, I am mostly self-taught and don’t have a formal computer science background. Over the years, I may have picked up the occasional tidbit of knowledge, but I never had a solid foundation in the theory behind algorithms and data structures.

Was this a problem? Nope, most of the time I was just fine. As modern day developers, using the data structures provided by the standard library is more than enough for much of the software we write. Swift’s arrays and dictionaries go a long way.

If you’re interested in leveling up on your algorithms and data structures, you’ve come to the right place. And when you’re done reading this book, head on over to The Swift Algorithm Club on GitHub for even more A&DS goodness!

Who This Book Is For:
This book is for developers who are comfortable with Swift and want to ace whiteboard interviews, improve the performance of their code, and ensure their apps will perform well at scale.








[related-news] [/related-news]