What is the complexity of the following algorithm in terms of Big-0?Algorithm func(x)sum =0for i in 1:xfor j in 1:10sum= sum +jendForendForfor i in 1:x/2print "*****EndForEndFunc01.0(n2)O 2.0(n)03. 0(1)04.0(logn) Question 2What is the complexity of the following algorithm in terms of Big-O?Algorithm func(x)i=1j=1if length(x) >1000while(i

1. Option (2). O(n) is the correct answer.

Answered: What is the complexity of the following…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

What is the asymptotic analysis of the algorithm for 2.1 f(n) = log x + n² + 14n + 15 is f(n) in O(n²), O(n³), 2(n²), Q(n), O(n² ), O(n), Q(n³), O(n), or ©(n³ ). 2.2 f(n) = 45x³ + 15x2 + 26x + 10 is f(n) in O(n?), O(n³), Q(n²), Q(n), O(n² ), 0(n), Q(n³), O(n), or 0(n³ )
Consider the pseudocode below. Algorithm Total(n) total = 5 for i = 1 to n + 1 for j = i to n for k = 1 to 3 total= total+ i ∗ j ∗ k end for end for end for return total What is the asymptotic class of the above algorithm as a function of n? Prove your assertions!
Please explain What is the big-O complexity of the following algorithm? void mystery(int* a, int n){ for (int i = 0; i < n; i++) { for (int j = 0; j < n - 1; j++) { if (a[j] > a[j + 1]) { swap(&a[j], &a[j + 1]); } } }} Group of answer choices a. O(n*n) b. (O(n*log(n)) c. O(n) d. O(n!)
Give an example of an algorithm that is O(1), an algorithm that is O(n) and an algorithm that is O(n2). Discuss the difference between them.
The time complexity equation of merger-sort is T(n) = 2* T(n/2) + n, where T(1) = C and C is a constant. Solve this equation by giving detailed steps. If you have an equation like the following T(n) = 3* T(n/3) + n, where T(1)=T(2)=C, what would be T(n)?
Consider the following algorithm: Algorithm mysterious(A[0..n − 1]) //Input: Array A[0..n − 1] of numbers //Output: ????????????????????????? x ← 0 for i ← 0 to n − 1 do for j ← 0 to n − 1 do if i ≠ j and |A[i] − A[j]| > x x ← |A[i] − A[j]| return x What does this algorithm do? Improve the algorithm by modifying the inner loop and its body. Propose another better algorithm to solve the problem.
Consider the following recursive algorithm, where // denotes integer division: 3//2 = 1, 5//2 = 2, etc. H(n): if n <= 1: return H(n//2) for i from 0 to n print(min(3, i)) Let function T(n) denote the running time of this algorithm. Derive T(n) and prove its worst case time complexity
Consider the following non-recursive algorithm: Algorithm Euclid2(m, n)//Input: Integers m and n where m >=n//Output: Greatest Common Divisor of m and nwhile n ≠ 0 do r ← m mod n m← n n ← r return m a) What does this algorithm compute?b) What is the input size for this algorithm?c) What is the basic operation of this algorithm?d) How many times the basic operation is executed worst case scenario?e) How many times the basic operation is executed in best-case scenario?
Give an O(n^2)-time algorithm to nd the longest monotonically increasing subsequence of a sequence of n numbers.Illustrate your algorithm on the sequence:8, 3, 7, 5, 9, 3, 4, 1, 9, 2, 6.
Consider the following recursive algorithm, where // denotes integer division: 3//2 = 1, 5//2 = 2, etc. F(n):if n <= 1: returnF(n//2)for i from 0 to n for j from 0 to n//2 print(i+j) Let function T(n) denote the running time of this algorithm. Derive T(n) and prove its worst case timecomplexity
Select the asymptotic worst-case time complexity of the following algorithm:AlgorithmInput: a1, a2, ..., an, a sequence of numbersn, the length of the sequencex, a numberOutput: ??For i = 1 to n-1For j = i+1 to nFor k = 1 to nIf ((ai)^2 + (aj)^2 = (ak)^2) Return( "True" )End-forEnd-forEnd-forReturn( "False" )a. ?(1)b. ?(?)c. ?(?2)d. ?(?3)
What is the time complexity of the following function- 5T(n/5+50)+n,T(1)=1 (a) θ(50logn) (b) θ(n50logn) (c) θ(logn) (d) θ(nlogn) (e) θ(nlogn)

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS

What is the complexity of the following algorithm in terms of Big-0? Algorithm func(x) sum =0 for i in 1:x for j in 1:10 sum= sum +j endFor endFor for i in 1:x/2 print "*****