π Data Structures & Algorithms in Swift
A guide to understanding and implementing data structures and algorithms using Swift. This book is designed to help developers learn the fundamentals of data structures and algorithms, along with practical implementations in Swift.
Details
URL: π https://www.kodeco.com/books/data-structures-algorithms-in-swift/v4.0
Published: Sep 15, 2021
Authors: Kelvin Lau
, Vincent Ngo
Tags:
Swift
, Data Structures
, Algorithms
, iOS Development
, Programming
Key Pointsβ
- Detailed explanations of various data structures and algorithms
- Practical Swift implementations for real-world applications
- Challenges and solutions to reinforce learning
- Emphasis on performance and optimization
Summary of Contentsβ
-
Introduction:
- Importance of learning data structures and algorithms
- Overview of Swift standard library
-
Section I: Elementary Data Structures
- Chapter 4: Stacks:
- Operations and implementation of stacks
- Chapter 6: Linked Lists:
- Node structure, adding, and removing values from linked lists
- Chapter 8: Queues:
- Array-based, doubly linked list, ring buffer, and double-stack implementations
- Chapter 4: Stacks:
-
Section II: Trees
- Chapter 10: Trees:
- Chapter 12: Binary Trees:
- Chapter 14: Binary Search Trees:
- Chapter 16: AVL Trees:
- Chapter 18: Tries:
-
Section III: Sorting Algorithms
- Chapter 26: O(nΒ²) Sorting Algorithms:
- Chapter 28: Merge Sort:
- Chapter 30: Radix Sort:
- Chapter 32: Heapsort:
- Chapter 34: Quicksort:
-
Section IV: Graphs
- Chapter 36: Graphs:
- Chapter 38: Breadth-First Search:
- Chapter 40: Depth-First Search:
- Chapter 42: Dijkstraβs Algorithm:
- Chapter 44: Primβs Algorithm:
Conclusionβ
- Summarizes the importance of data structures and algorithms in programming
- Encourages continuous learning and practice to master the concepts
Link to Bookβ