A problem can be solved in more than one way. Different algorithms have different characteristics in terms of time and space complexity. Also, some algorithms are more easier to parallelize than others. This section recaps the complexity analysis of various algorithms and demonstrates how it affects stability. It also has a section on distributed algorithms.
Scaling algorithms
Algorithm complexity
Time complexity of an algorithm defines the amount of time taken by an algorithm to run as a function of the input size. Similarly, the space complexity of an algorithm gives a measure for the amount of space (memory) taken by an algorithm to run for a specific length of the input. These complexity metrics define how much time and...
