Page 1 of 1
Say we have two different algorithms with respective runtimes of f(n) and g(n). Given the following cases, prove whether
Posted: Mon Jul 11, 2022 9:54 am
by answerhappygod
- Say We Have Two Different Algorithms With Respective Runtimes Of F N And G N Given The Following Cases Prove Whether 1 (31.83 KiB) Viewed 44 times
Say we have two different algorithms with respective runtimes of f(n) and g(n). Given the following cases, prove whether or not f(n) = (g(n)) is true in each case. Show your work but with the crucial steps only. You will be penalized for up to 1 pt in total if your work exceeds a whole A4 page in 12px font size. P.S. sqrt(n) means the square-root of n, aka n^(1/₂). Case f(n) log(n) sqrt(n) 2^n A B C g(n) log(n^2) log(n) 3^n