The table below is ranked from low to high.
| Function | Name |
|---|---|
| \(c\) | Constant |
| \(\log N\) | Logarithmic |
| \(\log^2 N\) | Log-squared |
| \(N\) | Linear |
| \(N \log N\) | |
| \(N^2\) | Quadratic |
| \(N^3\) | Cubic |
| \(2^N\) | Exponential |
Growth Rates Ranking
-
The Pragmatic Programmer
Use Big O notation# to mathematically approximate the upper bound of the algorithm speed or memory usage. Its limitation is that there’s no way telling if there are differences between two algorithm speed or memory usage with the same growth rates#.
-
Stream Cipher
However, the keystream should be of one use# to prevent the possible recovery of the plaintext. Therefore, Stream Cipher exhibits the properties where it will encrypt the data with long period with no repetitions and statistically random. Though it does rely on large key size and have a large linear complexity.
-
Relative Growth Rates
See Growth Rates Ranking#
-
Euler Path
A graph could be determined as an Euler Path by using #202205021959. This will result in a linear runtime complexity.
-
Euler Circuit
A graph could be determined as an Euler Circuit by using #202205021959. This will result in a linear runtime complexity.