CS 520: Analysis of Algorithms
Mark Boady
Department of Computer Science
Drexel University
April 26, 2020
Mark Boady CS 520: Analysis of Algorithms 1 / 22
Algorithms
What does it mean to work well?
1 Works Correctly
2 Runs Efficiently
3 Uses Memory Efficiently
4 Uses Networks Efficiently
5 Uses Screen Space Efficiently
It depends what the goals are.
Numbers 1 and 2 should always be important
Mark Boady CS 520: Analysis of Algorithms 2 / 22
Algorithms
The implementation is built on Algorithms
Goals:
1 Easy to Understand, Code, and Debug
2 Efficient
Measuring Efficiency
1 Size of Input
2 Quality of Compiler (Compiler Optimizations)
3 Machine Speed
4 Time Complexity of Algorithm
Mark Boady CS 520: Analysis of Algorithms 3 / 22
Running Time
Formal Specification of Running Time
T(n) = · · ·
T for running Time
n is the size/number of inputs
Generally the result is numbe
The post CS 520: Analysis of Algorithms appeared first on Assignment Freelancers.