Use big-theta notation to classify the traditional grade school algorithms for a

Question

Use big-theta notation to classify the traditional grade school algorithms for addition and multiplication If asked to add two numbers each having n digits, how many individual additions must be performed? If requested to multiply two n-digit numbers, how many individual multiplications are required? Definition of the big theta notation Example of the big theta notation f(n) = n2 + 5n + 10 f(n) => Theta(n2) f(n) = n + log(n) + 1 f(n) => Theta(n) f(n) = 200 f(n) => Theta(1) f(n) = log(n) + 20 f(n) => Theta(log(n))

Explanation / Answer

//Hope this will helpyou. 1. if we have two n digit number then we will need addition ntimes. so It will be order of n, hence in big notation it will beTheta(n) 2. For Multipication, If we have two n digit number, then we will need to nxn multipication, so it will be order of Thea(n2 )

Related Questions

Navigate

• Browse (All)
• Browse U
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.