kodecocodes/swift-algorithm-club

The Swift Algorithm Club is a learning resource that implements common algorithms and data structures in Swift, each accompanied by a plain-English explanation of how it works. The goal is not to produce a drop-in library but to make the concepts understandable, the focus is on readable code and clear explanations rather than raw performance optimization. The collection covers algorithms in several areas. Searching algorithms include linear search, binary search (which finds items quickly in a sorted list by repeatedly halving the search space), and union-find. String search algorithms include Boyer-Moore and Knuth-Morris-Pratt, which scan text efficiently by skipping sections rather than checking every character. Sorting algorithms range from simple educational ones like insertion sort and bubble sort to fast practical ones like quicksort, merge sort, and heap sort. Compression methods include run-length encoding and Huffman coding. Data structures covered include stacks, queues, heaps, binary search trees, hash tables, tries, graphs, and several variants of arrays. There is also a mathematics section covering things like greatest common divisor and permutations, and a machine learning section covering k-Means clustering and linear regression. Someone would use this repository when learning computer science fundamentals, preparing for technical interviews, or wanting a readable reference implementation of a specific algorithm before adapting it for their own Swift project. The code targets Xcode 10 and Swift 4.2.