This project provides a framework for commonly used data structures and algorithms written in a new iOS development language called Swift. While details of many algorithms exists on Wikipedia, these implementations are often written as pseudocode, or are expressed in C or C++. With Swift now officially released, its general syntax should be familiar enough for most programmers to understand.
Features
The project features code-level examples for the following items:
- Linked Lists
- Binary Search
- Insertion Sort
- Bubble Sort
- Selection Sort
- Quick Sort
- Binary Search Trees
- Tree Balancing – Rotations
- Stacks
- Queues
- Heaps & Heapsort Operations
- Hash Tables
- Tries
- Graphs
- Dijkstra’s Shortest Path
- Depth-First Search
- Breadth-First Search
- Protocol Extensions
- Enumerations
- Fibonacci Numbers
- Generics
- Dyanmic Programming
- Closures
Leave a Reply
You must be logged in to post a comment.