19The complexity of the following code isint i, j,k = 0;(i = n/ 2; i <= n; i++) {for (jk = k + n / 2;%3Dforat of= 2; j <= n; j = j * 2) {uestionSelect one:a. O(nlgn)b. O(n)O c. (n'ign)d. O(n)

EXPLANATION: For the outer for loop, the value of the loop variable starts from n/2 and goes up to…

The complexity of the following code is int i, j, k = 0; for (i = n / 2; i <= n; i++) { for (j k = k + n / 2; %3D 2; j <= n; j = j * 2) { %3D %3D %3D Select one: a. O(nlgn) b. O(n) c. O(n'Ign) d. O(n)

The complexity of the following code is int i, j, k = 0; for (i = n / 2; i <= n; i++) { for (j k = k + n / 2; %3D 2; j <= n; j = j * 2) { %3D %3D %3D Select one: a. O(nlgn) b. O(n) c. O(n'Ign) d. O(n)

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

If f(n) is the number of times that y=y+A[i]; is executed in the code segment below, which of the following is the correct big-Oh notation for f? y=0;for(j=0;j<n;j++) { for (i=0;i<n;i++) { y=y+A[i]; }} Group of answer choices O(1) O(n2) O(nlog2n) O(n)
Find the space complexity of the following code fib(int n) { if (n <= 1) return n; return fib(n-1) + fib(n-2); }
b. The following is the code for the 3-SUM problem what is the tilde notation for the array access? public static int count(int[] a) { int n = a.length; 0; 0; i < n; i++) { %3D int count = for (int i = %3D for (int j = i+1; j < n; j++) { %3D for (int k if (a[i] + a[j] + a[k] j+1; k < n; k++) { e) { %3D == count++; } } } } return count; }
method SumTon(n:int) returns (s:int) requires n > = 0 ensures s = = n*(n+1)/2 // THE = (k-1)*k FORMULA! { var k: = 0; s: = 0; while k <= n invariant 0 < = k < = n+1 && S = /2 {s:= s + k; k: = k + 1; } //1A!B=s= = (k-1)*k/2 && k = = n+1 = postcondition } Using this method as starting point, change the method so that the loop instead `iterates down' from n to 0. You should continue to use just one local variable as index (stay in the spirit of this exercise). The method should continue to verify of course. Call the new method SumTonDown. =
void- find and replace (char A, char *oldc, char newc) for (int i-0; i<5; i++) for (int j%3D0; j<3; j++) == oldc[jl) A[i] = newc[j]: if (A[i] The procedure is tested with the following four test cases. 1. oldc 2. oldc "abc" , newc = "cde", newc = "dab" "bcd" 3. oldc 4. oldc = "abc", newc = "bca", newc= "cda" = "bac"
Evaluate the performance per line
What type of sort is represented by the following code? public void sort(int arrayToSort[]) { int n = arrayToSort.length; for (int num =n/2; num > 0; num /= 2) { for (int i = num;i= num && arrayToSort[j - num] > key) { arrayToSort[j] = arrayToSort[j - num]; j-= num; arrayToSort[j] = key; radix bubble shell selection insertion quick