Author: k***e
Date:
Review: Measuring execution time directly (e.g., in seconds) is not enough to compare two algorithms because of a lot of factors. This is where complexity (time and space) is introduced. In time complexity we don't use seconds in comparing two algorithms, because it depends on the hardware used. Instead basic operations is used. We also conside best, worst and average cases. Space compmory is fixed, like the code itself, while some grows with the input. These two complexity is very important. But we also need to consider the hardware used. A good algorithm should first be tested on an older or slower computer to ensure it works correctly before running it on a faster machine to evaluate efficiency. An algorithm must be independent on its hardware but it's a more faster machine or a more optimized compiler can significantly reduce execution time, even for a less efficient algorithm. By considering time and space comp
Color: Dark Wash
Size: S
