Please enable JavaScript.
Coggle requires JavaScript to display documents.
Algorithms (Features (Input - It has zero or more input quantities…
Algorithms
-
Features
-
-
Definiteness - Each step of the algorithm must be precisely defined and the action to be executed must be rigorous and unambiguously specified.
-
-
Performance & Analysis
Experimental Studies
-
a simple method for collecting running times in Java is based on the use of the currentTimeMillis method of the System class
-
-
-
Limitations
can only be done on a limited set of inputs and may not be indicative of the running time on other inputs
to compare the algorithms, the same hardware and software environments should be used
-
Theoretical Analysis
-
Time Complexity - develop a formula for predicting how fast an algorithm is, based on the size of the input
Space Complexity - develop a formula for predicting how much memory an algorithm requires, based on the size of the input
-
-
Metrics
Ease of programming - bugs, maintenance
-
-
-