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.
What is the c4arl0s/AlgorithmsAndDataStructuresInSwift GitHub project? Description: "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.". Explain what it does, its main use cases, key features, and who would benefit from using it.
Question is copied to clipboard — paste it after the AI opens.
Clone via HTTPS
Clone via SSH
Download ZIP
Download master.zipReport bugs or request features on the AlgorithmsAndDataStructuresInSwift issue tracker:
Open GitHub Issues