Successorship Algorithm (CPU)

The Successorship algorithm.

The successorship algorithm runs a for loop for ℕ iterations.

What are the inputs to the function?

The input to this function is ( ℕ ) where is the upper bound to the function.

The algorithm in laymen

// Start the timer

for (int i = 0; i < ℕ; i++) { }

// End the timer

Example of the function

ℕ = 10,000.

for (int i = 0; i < 10000; i++) { }