Math Problem Statement
10.- Considérese las siguientes funciones sobre n: f1(n)=n2 f2(n)=n2 + 1000n f3(n)=[ n si n es impar | n 3 si n es par ] f4(n)= [n si n<=100 | n 3 si n>100 ] Para cada posible par de valores de i y j, indíquese si fi(n) es O(fj(n)) o no
Solution
Ask a new question for Free
By Image
Drop file here or Click Here to upload
Math Problem Analysis
Mathematical Concepts
Big-O Notation
Asymptotic Analysis
Complexity Theory
Formulas
f1(n) = n^2
f2(n) = n^2 + 1000n
f3(n) = n if n is odd, n^3 if n is even
f4(n) = n if n ≤ 100, n^3 if n > 100
Theorems
Big-O Notation Definition
Comparison of Polynomial Growth
Suitable Grade Level
Undergraduate (Intro to Algorithms)