Using the Big Oh Notation Write the complexity of the following:1. sum = 0;for ( i = 1; i<= X; i++)sum += i ;for (j=1 ; j<= Y; j+)sum += j ;2. sum = 0;for (i =1; i<=X;i++)for( j = 1;j<= Y ;j+)for ( k = 1; k <= X; k++ )sum += (i*j* k ) ;3. sum = 0;for (i =1; i<= X; i = i * 2 )sum += i;

I have answered the question in step 2.

Using the Big Oh Notation Write the complexity of the following: 1. sum = 0; for (i = 1 ; i <= X; i++) sum += i; for (j = 1;j<= Y ; j++) sum += j ; 2. sum = 0; %3D for ( i= 1 ; i <= X; i++) for( j=1 ;j<= Y ; j+) for ( k = 1; k <= X ; k++ ) sum += (i*j*k) ; 3. sum = 0; for (i =1; i<= X;i=i* 2) sum += i ;

Using the Big Oh Notation Write the complexity of the following: 1. sum = 0; for (i = 1 ; i <= X; i++) sum += i; for (j = 1;j<= Y ; j++) sum += j ; 2. sum = 0; %3D for ( i= 1 ; i <= X; i++) for( j=1 ;j<= Y ; j+) for ( k = 1; k <= X ; k++ ) sum += (ijk) ; 3. sum = 0; for (i =1; i<= X;i=i* 2) sum += i ;

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

N = 1397 Max = 19213 Min = 4+2 = 6 Can you kindly show and explain the steps? How to solve these problems?
programming. Analyze the Big-O complexity of the following code segment: int j, k, sum = 0; for (j = 0; j
1. a) What will be the Big-O complexity of the following code snippets? for (i=1, j=1; i=n; i=i*2) (i) printf ("It is not complex.\n"): j++; for (k=1; k<=n;k++) printf ("Complexity");
2. The function f is defined for non-negative integers a and b recursively as follows: f (а, b) 3D1 if a = 0 or b = 0 f (a - 1, b f (a f (а, а) 1) + 2a - 1 if a if a > b if a < b b b, b) + f (b, b) + f (b а, а) } Compute f (2, 3) by drawing a recursion tree showing all of the computation required and then use your tree to compute the answer.
Calculate the time complexity and represent by using asymptotic notation for the following code: int p=3, r=2; int f=1; for(int i=0; i
for "ii" use the subsitution method please
Find the Time Complexity = Find the Space Complexity =
Use Master Therom to determine the complexity of the following:
The time complexity of the following code is O(n^2). In C++, write a code to confirm the time complexity of the following pseudocode: int j = 2 while (j<n) { int k = j while (k<n) { sum += a[k]=b[k] k += n^1/3 log n } j = j*sqrt(5) }
Explains the Details. This concept is Design Algorithm & Analysis.