GitHub / c4arl0s / AlgorithmsAndDataStructuresInSwift
This course teach you the importance to know how efficient is written your code by using a mathematical model which is function of the size of its inputs. All the code is implemented in Swift and documented in GitHub. Some lines were corrected and improved by renaming variables and functions. By the other hand, a list of sort algorithms are implemented and its execution time is measured. These algorithms are classified in basic and advanced. At the end of each classification there is a section where you can compare its execution time between them. The conclusions are crucial because they revels how Swift implements the sort instance method when you create an array of any type.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/c4arl0s%2FAlgorithmsAndDataStructuresInSwift
PURL: pkg:github/c4arl0s/AlgorithmsAndDataStructuresInSwift
Stars: 0
Forks: 0
Open issues: 0
License: mit
Language:
Size: 290 KB
Dependencies parsed at: Pending
Created at: over 5 years ago
Updated at: over 1 year ago
Pushed at: over 1 year ago
Last synced at: over 1 year ago
Topics: big-o-notation, collections, recursion, sorting-algorithms-implemented, swift