Merge sort is a divide and conquer algorithm that has a lower order running time than the insertion sort. The merge sort algorithm works by using recursion; it will repeatedly divide an unsorted list into two halves. When the list has a single item or it is empty it is considered sorted; this is called the base case. The majority of the sorting work is performed in the merge function, which is responsible for combining the two halves back together. The merge function uses a temporary array of equal size to the input array during the merge process so it has a higher order auxiliary space of O(n). Because of this, merge sort is generally better off implemented for sorting a linked list instead of an array. We'll look at both implementations so you can see the performance differences based on the dataset size.
Swift Data Structure and Algorithms
By :
Swift Data Structure and Algorithms
By:
Overview of this book
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.
Related Content you might be interested in
Current Title:
Swift Data Structure and Algorithms
No titles found
Table of Contents (15 chapters)
Swift Data Structure and Algorithms
Credits
About the Authors
About the Reviewers
www.PacktPub.com
Preface
Free Chapter
Walking Across the Playground
Working with Commonly Used Data Structures
Standing on the Shoulders of Giants
Sorting Algorithms
Seeing the Forest through the Tree
Advanced Searching Methods
Graph Algorithms
Performance and Algorithm Efficiency
Choosing the Perfect Algorithm
Customer Reviews