The Swift Algorithm Club is a popular open source project to implement popular algorithms and data structures in Swift, with over 14,000 stars on GitHub.
We periodically give status updates with how things are going with the project. This month, we report on our progress with the Swift 4 update.
Swift 4 Migration – Finished!
I’m happy to announce the Swift Algorithm Club community has successfully merged all 88 articles over to Swift 4!
It made me so happy to see the community working together like this. A big thanks to everyone involved!
4 New Submissions
In addition to the Swift 4 update, this month we’re happy to announce 4 new submissions to the Swift Algorithm Club project!
1) Minimum Spanning Tree
This month, Vincent Ngo wrote a tutorial on implementing Prim’s Algorithm in Swift. This is a useful algorithm to compute the optimal path from point A to point B in a graph.
2) The Egg Drop Problem
The egg drop problem is a popular interview question brought in by Google. Given a couple of very durable eggs, find out which floor will make them crack if you drop the in a building.
3) Splay Trees
Splay trees are a special type of self-balancing binary search tree that adjusts itself based on recently accessed values. Every
remove operation causes a node to be splayed to the root of the tree.
Want to keep track of the most recently used objects? The splay tree is here for you.
Also known as a Bag, the Multiset is a Set that also keeps tracks of the number of times that an element has been inserted. Inserting a value that already exists in the set increments the count of that particular value.
Where To Go From Here?
The Swift Algorithm Club is always looking for new members. Whether you’re here to learn or here to contribute, we’re happy to have you around.
To learn more about the SAC, check out our introductory article. We hope to see you at the club! :]