A Man on A Planet

1. maxSubSum1
   1. N = 5,000
      1. Sum[Sum[Sum[1, {k, i, j}], {j, i, 4999}], {i, 0, 4999}]
      2. T(N) ≈ 83337962547 ns
      3. 2.08458 x 10¹⁰
   2. 10,000
      1. tbd
   3. 20,000
      1. tbd
   4. 50,000
      1. tbd
2. maxSubSum2
   1. N = 5,000
      1. Sum[Sum[1, {j, i, 4999}], {i, 0, 4999}]
      2. T(N) ≈ 863884305 ns
3. maxSubSum3
4. maxSubSum4

Legend:

1. function/algorithm
   1. input size
      • Mathematica form
      • Run-time
      • Complexity (no. of operations)

Formulae

Exponents

xaxb

Logarithms

loga

Series

• 

  Mathematica form: Sum[i, {i, 1, n}]

• 

  Mathematica form: Sum[i^2, {i, 1, n}]

• 

  Mathematica form: Sum[i^2, {i, 1, n}]

• 

  Mathematica form:

• else…