Swift Algorithms & Data Structures, 5th Edition

Swift, first introduced by Apple in 2014, has quickly become a cornerstone of iOS, macOS, watchOS, and tvOS development. With over a decade of evolution and refinement, Swift is now the primary language for building apps across Apple's ecosystem. It's used daily by developers worldwide to create everything from simple utility apps to complex, data-driven applications. This project provides a framework for commonly used data structures and algorithms written in Swift, offering practical implementations that go beyond the pseudocode or C/C++ examples often found on Wikipedia.

Audience

As a developer, you should already be familiar with the basics of programming. Beyond algorithms, this project also aims to provide an alternative for learning the basics of Swift. This includes implementations of many Swift-specific features such as optionals, extensions, protocols and generics. Beyond Swift, audiences should be familiar with Singleton and Factory design patterns along with sets, arrays and dictionaries.

Table of Contents

1. Introduction
2. Big O Notation
3. Basic Sorting
4. Advanced Sorting
5. Generics
6. Linked Lists
7. Tries
8. Stacks & Queues
9. Binary Search Trees
10. Tree Balancing
11. Graphs
12. Shortest Paths
13. Heaps
14. Traversals
15. PageRank
16. Blockchain Design
17. Hash Tables
18. Closures
19. Control Structures
20. Recursion
21. Dynamic Programming
22. Unit Testing
23. Objective-C Primer

The Book

Now in its 5th edition and supporting the latest version of Swift, the Swift Algorithms Book features code and color illustrations that benefits students and professionals. As a collaborative open-source effort, I also welcome feedback and contribution from others.

Example

//bfs traversal with inout closure function
func traverse(_ startingv: Vertex, formula: (_ node: inout Vertex) -> ()) {
    //establish a new queue
    let graphQueue: Queue<Vertex> = Queue<Vertex>()
    
    //queue a starting vertex
    graphQueue.enQueue(startingv)
    
    while !graphQueue.isEmpty() {
        //traverse the next queued vertex
        guard var vitem = graphQueue.deQueue() else {
            break
        }
        
        //add unvisited vertices to the queue
        for e in vitem.neighbors {
            if e.neighbor.visited == false {
                print("adding vertex: \(e.neighbor.key) to queue..")
                graphQueue.enQueue(e.neighbor)
            }
        }
        
        //invoke formula
        formula(&vitem)
    } //end while
    
    print("graph traversal complete..")
}

Other Projects

• bishop-algorithms-swift-package - Examples of commonly used algorithms and data structures in Swift Package format.
• bishop-app-runbuddy-swift - Plan your next run using Generative AI. Implemented in Swift.
• bishop-app-runbuddy-python - A machine learning model that recommends athletic clothing based on weather conditions.

Usage

Individuals are welcome to use the code with commercial and open-source projects. As a courtesy, please provide attribution to waynewbishop.com. For more information, review the complete license agreement.

Questions

Have a question? Feel free to contact me online.