Swift Data Structure and Algorithms

Erik Azar, Mario Eguiluz Alebicto



Master the most common algorithms and data structures, and learn how to implement them efficiently using the most up-to-date features of Swift 3

Apple’s Swift language has expressive features that are familiar to those working with modern functional languages, but also provides backward support for Objective-C and Apple’s legacy frameworks. These features are attracting many new developers to start creating applications for OS X and iOS using Swift.

Designing an application to scale while processing large amounts of data or provide fast and efficient searching can be complex, especially running on mobile devices with limited memory and bandwidth. Learning about best practices and knowing how to select the best data structure and algorithm in Swift is crucial to the success of your application and will help ensure your application is a success. That’s what this book will teach you.

Starting at the beginning, this book will cover the basic data structures and Swift types, and introduce asymptotic analysis. You’ll learn about the standard library collections and bridging between Swift and Objective-C collections. You will see how to implement advanced data structures, sort algorithms, work with trees, advanced searching methods, use graphs, and performance and algorithm efficiency. You’ll also see how to choose the perfect algorithm for your problem.

Table of Contents

1: WALKING ACROSS THE PLAYGROUND
2: WORKING WITH COMMONLY USED DATA STRUCTURES
3: STANDING ON THE SHOULDERS OF GIANTS
4: SORTING ALGORITHMS
5: SEEING THE FOREST THROUGH THE TREE
6: ADVANCED SEARCHING METHODS
7: GRAPH ALGORITHMS
8: PERFORMANCE AND ALGORITHM EFFICIENCY
9: CHOOSING THE PERFECT ALGORITHM

PDF (conv) + EPUB + MOBI + AZW3: