Aim/Scope of Project: To enhance/implement a number of the common data structures/algorithms using the Swift programming language.
Significance of Project: Data Structures and Algorithms are important for solving problems in a logically appropriate and time efficient manner.
Language: Swift
Division Of Work:
Christian: Radix/Counting Sort, Trie.
Ashwin: Splay Trees, Red and Black Trees
Jayson: Threaded Binary Trees, Fibonacci Heaps
Steven: B-Trees, Adjacency Lists and/or Matrices
3 of 3
Project Details (cont.)
Community: Primarily individuals interested in the theory and or individuals looking to use the provided implementations as a means of learning about them.
Distribution: MIT License, with the hope that those interested in learning about Data Structures and Algorithms will inform others of the project’s potential as an educational resource.
Sustainability of Project: This repository has received almost daily updates since its creation in January 2016, and is structured well to support expansion and modification
Timeline/Schedule (subject to change)
Week 1: Review Data Structures and Algorithms to be implemented and implement them with Pseudocode
Week 2-3: Implement/Prototype Data Structure/Algorithm
Week 4: Unit Testing/Debugging and Drafting Markdown File with explanation of Data Structure/Algorithm
Week 5: Submit Pull Request/Make adjustments to code and or documentation as needed