
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
Learn 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! In this book, you'll learn how to implement the most popular and useful data structures, and when and why you should use one particular data structure or algorithm over another. This set of basic data structures and algorithms will serve as an excellent foundation for building more complex and special-purpose constructs. As well, the high-level expressiveness of Swift makes it an ideal choice for learning these core concepts without sacrificing performance. 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. Topics Covered in Data Structures & Algorithms in Swift * Basic structures: Start with the fundamental structures of linked lists, queues and stacks, and see how to implement them in a highly Swift-like way. * Trees: Learn how to work with various types of trees, including general purpose trees, binary trees, AVL trees, binary search trees, and tries. * Sorting: Go beyond bubble and insertion sort with better-performing algorithms, including mergesort, radix sort, heap sort, and quicksort. * Graphs: Learn how to construct directed, non-directed and weighted graphs to represent many real-world models. * Traversals: Traverse graphs and trees efficiently with breadth-first, depth-first, Dijkstra's and Prim's algorithms to solve problems such as finding the shortest path or lowest cost in a network. * And much, much more! By the end of this book, you'll have hands-on experience solving common issues with data structures and algorithms - and you'll be well on your way to developing your own efficient and useful implementations!
This book investigates the practical implementation and application of essential data structures and algorithms within the Swift programming language. The authors, drawing from the expertise of Kelvin Lau and the Raywenderlich.com Tutorial Team, aim to equip developers with the knowledge to create more efficient and scalable applications. It covers fundamental structures like linked lists, queues, and stacks, progressing to more complex topics such as trees (binary, AVL, BST, tries), sorting algorithms (mergesort, radix sort, heapsort, quicksort), and graph representations and traversals (BFS, DFS, Dijkstra's, Prim's). The book emphasizes Swift's expressiveness for learning these concepts without sacrificing performance, targeting developers seeking to improve code efficiency, ace interviews, and build robust apps.
This book is positioned as a practical guide for Swift developers aiming to deepen their understanding of data structures and algorithms. The content suggests a focus on hands-on implementation and performance optimization, making it suitable for those preparing for technical interviews or seeking to enhance their app development skills. The inclusion of advanced topics like graph traversals and various tree types indicates a comprehensive approach to the subject matter. The emphasis on Swift's capabilities for these implementations points to a target audience comfortable with the language's syntax and paradigms.
Page Count:
280
Publication Date:
2018-03-13
Publisher:
Razeware LLC
ISBN-10:
1942878486
ISBN-13:
9781942878483
No comments yet. Be the first to share your thoughts!