Algorithms and Data Structures in Swift: A Practical Guide for iOS

Algorithms and Data Structures in Swift: From Theory to Real iOS Projects

Swift is not just a modern and safe programming language for the Apple ecosystem. It is a powerful tool that allows you to write efficient and performant code for iOS, macOS, watchOS, and tvOS. However, to create truly fast and scalable applications, knowledge of syntax alone is not enough. Understanding fundamental algorithms and data structures is what distinguishes a junior developer from a senior engineer.

In this article, we will break down key data structures and algorithms in the Swift language with practical examples. You will see how to implement a stack, queue, binary search, and sorting, and also understand where this knowledge is applied in real iOS application development. Let's go!

1. Stack and Queue: Fundamental Structures

Stack and queue are two basic data structures that are often used in iOS development. For example, a stack is used for navigation in UINavigationController, and a queue is used for managing tasks in OperationQueue or DispatchQueue.

Stack Implementation (LIFO — Last In, First Out)

A stack works on the principle of "last in, first out". Adding an element (push) and removing it (pop) happen from one end — the top of the stack.

struct Stack<Element> {\n    private var storage: [Element] = []\n    \n    mutating func push(_ element: Element) {\n        storage.append(element)\n    }\n    \n    @discardableResult\n    mutating func pop() -> Element? {\n        return storage.popLast()\n    }\n    \n    func peek() -> Element? {\n        return storage.last\n    }\n    \n    var isEmpty: Bool {\n        return storage.isEmpty\n    }\n}\n\n// Example usage\nvar navigationStack = Stack<String>()\nnavigationStack.push("Main Screen")\nnavigationStack.push("Product Details")\nnavigationStack.push("Cart")\nprint(navigationStack.pop() ?? "") // Prints: "Cart"\nprint(navigationStack.peek() ?? "") // Prints: "Product Details"

Where it is applied: Undo/Redo operations, checking bracket correctness in parsers, depth-first tree traversal (DFS).

Queue Implementation (FIFO — First In, First Out)

A queue works on the principle of "first in, first out". Elements are added to the end (enqueue) and removed from the beginning (dequeue).

struct Queue<Element> {\n    private var storage: [Element] = []\n    \n    mutating func enqueue(_ element: Element) {\n        storage.append(element)\n    }\n    \n    @discardableResult\n    mutating func dequeue() -> Element? {\n        guard !storage.isEmpty else { return nil }\n        return storage.removeFirst()\n    }\n    \n    func peek() -> Element? {\n        return storage.first\n    }\n    \n    var isEmpty: Bool {\n        return storage.isEmpty\n    }\n}\n\n// Example usage\nvar taskQueue = Queue<String>()\ntaskQueue.enqueue("Download Images")\ntaskQueue.enqueue("Data Sync")\ntaskQueue.enqueue("Send Analytics")\nprint(taskQueue.dequeue() ?? "") // Prints: "Download Images"

Where it is applied: Processing network requests, breadth-first tree traversal (BFS), task queues in background threads.

2. Binary Search: Speed vs. Simplicity

Binary search is a classic algorithm that finds an element in a sorted array in logarithmic time O(log n). In iOS, it is often used when working with large sorted datasets, for example, when searching for contacts or records in a database.

func binarySearch<T: Comparable>(in array: [T], target: T) -> Int? {\n    var lowerBound = 0\n    var upperBound = array.count - 1\n    \n    while lowerBound <= upperBound {\n        let midIndex = (lowerBound + upperBound) / 2\n        let midValue = array[mid