Computational complexity of mathematical operations
Algorithmic runtime requirements for common math procedures
Computational complexity of mathematical operations
The following tables list the computational complexity of various algorithms for common mathematical operations. Here, complexity refers to the time complexity of performing computations on a multitape Turing machine. See big O notation for an explanation of the notation used. Note: Due to the variety of multiplication algorithms, M ( n ) {\displaystyle M(n)} below stands in for the complexity of the chosen multiplication algorithm.
Read on Wikipedia · Image Cmglee, CC BY-SA 4.0
Open boosters, collect cards and trade them. Free to play.
Play for free