92 views

Uploaded by mashuashu

- 970770 HR Interview Questions Tech Preparation
- 8 Free Electron Models of Conductivity
- wow quest
- Line Algorithms
- WIMAX Final
- 132010_2
- 3d Transformations
- system analysis and design
- Sapiens: A Brief History of Humankind
- The Unwinding: An Inner History of the New America
- The Subtle Art of Not Giving a F*ck: A Counterintuitive Approach to Living a Good Life
- Shoe Dog: A Memoir by the Creator of Nike
- Never Split the Difference: Negotiating As If Your Life Depended On It
- The Library Book
- Hidden Figures: The American Dream and the Untold Story of the Black Women Mathematicians Who Helped Win the Space Race
- Elon Musk: Tesla, SpaceX, and the Quest for a Fantastic Future
- Team of Rivals: The Political Genius of Abraham Lincoln
- Yes Please
- John Adams
- Devil in the Grove: Thurgood Marshall, the Groveland Boys, and the Dawn of a New America

You are on page 1of 1

Proof: by the Big-Oh definition, T(n) is O(n3) if T(n) ≤ c·n3 for some n ≥ n0 . Let

20 1

us check this condition: if n3 + 20n + 1 ≤ c·n3 then 1 + 2 + 3 ≤ c . Therefore,

n n

the Big-Oh condition holds for n ≥ n0 = 1 and c ≥ 22 (= 1 + 20 + 1). Larger

values of n0 result in smaller factors c (e.g., for n0 = 10 c ≥ 1.201 and so on) but in

any case the above statement is valid.

Proof: by the Big-Oh definition, T(n) is O(n2) if T(n) ≤ c·n2 for some n ≥ n0 . Let

20 1

us check this condition: if n3 + 20n + 1 ≤ c·n2 then n + + ≤ c . Therefore,

n n2

the Big-Oh condition cannot hold (the left side of the latter inequality is growing

infinitely, so that there is no such constant factor c).

Proof: by the Big-Oh definition, T(n) is O(n4) if T(n) ≤ c·n4 for some n ≥ n0 . Let

1 20 1

us check this condition: if n3 + 20n + 1 ≤ c·n4 then + 3 + 4 ≤ c . Therefore,

n n n

the Big-Oh condition holds for n ≥ n0 = 1 and c ≥ 22 (= 1 + 20 + 1). Larger values

of n0 result in smaller factors c (e.g., for n0 = 10 c ≥ 0.10201 and so on) but in any

case the above statement is valid.

Proof: by the Big-Omega definition, T(n) is Ω(n2) if T(n) ≥ c·n2 for some n ≥ n0 .

20

Let us check this condition: if n3 + 20n ≥ c·n2 then n + ≥ c . The left side of

n

this inequality has the minimum value of 8.94 for n = 20 ≅ 4.47 Therefore, the

Big-Omega condition holds for n ≥ n0 = 5 and c ≤ 9. Larger values of n0 result in

larger factors c (e.g., for n0 = 10 c ≤ 12.01) but in any case the above statement is

valid.

- 970770 HR Interview Questions Tech PreparationUploaded bySaurabh Gupta
- 8 Free Electron Models of ConductivityUploaded bymashuashu
- wow questUploaded bymashuashu
- Line AlgorithmsUploaded byKunal
- WIMAX FinalUploaded bymashuashu
- 132010_2Uploaded bymashuashu
- 3d TransformationsUploaded bymashuashu
- system analysis and designUploaded bymashuashu