dining Time: 55 minutes, 10 seconds.v Question Completion Status:QUESTION 4Determine the complexity of the following codeWhile( n >1 ){System.out.println ("hello");n=n/2;}O O(1)O O(n)O O(logn)O oin?)Click Save and Submit to save and submit. Click Save All Answers to save all answers.Save All1O10TOSHIBA

Refer to step 2 for the answer.

Answered: While( n >1 ) System.out.println…

Engineering

Computer Science

While( n >1 ) System.out.println ("hello"); n=n/2; } O 0(1) O O(n) O O(logn) O On?)

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

PLEASE HELP!
Find the values of n and m to solve this puzzle int n = ? int m = ? int t = 76; int s = 0; char *msg = "Do you like spaghetti? Try some spaghetti! It's good, right?\n" "What, you prefer structured loops? How mundane.\n"; goto LTOP; LEND: failure(msg); LOM1: n = (n<<2) - n + 1; LCHK: if(s == t && m == t){ goto LAFT; } s++; goto LTOP; LOC1: if(n & 1){ goto LOM1; } goto LEM1; LTOP: if(!(n>1)){ goto LEND; } goto LOC1; LEM1: n = n >> 1; goto LCHK; LAFT: return;
def hailstone(n): h.append(int(n)) if n == 1: return h while n != 1: if n % 2 == 0: return hailstone(int(n/2)) else: return hailstone(int(3*n + 1))y=int(input("N: "))if y <= 0: print("N must be positive!")else: print("Hailstone sequences for 1 to " + str(y) + ":") m=0; i=1 for x in range(1, y+1): n = i h = [] h = hailstone(n) print(h) s=len(h) if s > m: m=s flag=n i=i+1 print("First longest sequence found in n =", + flag ) If i don't one the output have the square braket? How can I fix this code? Can you pleasw help me?
What is the value of the variable ss after the following code is executed? int x[ 7 ] = (5,10,3,0,-10, 4); int ss=0; for (int i=1;i<=6; i++) { ss+=x[i]; cout<
def hailstone(n): h.append(int(n)) if n == 1: return h while n != 1: if n % 2 == 0: return hailstone(int(n/2)) else: return hailstone(int(3*n + 1))y=int(input("N: "))if y <= 0: print("N must be positive!")else: print("Hailstone sequences for 1 to " + str(y) + ": ") m=0; i=1 for x in range(1, y+1): n = i h = [] h = hailstone(n) print(*h) print(",") s=len(h) if s > m: m=s flag=n i=i+1 print("First longest sequence found in n =", + flag ) How can I fix this code if I want a comma between each number, not each line?
Generate test cases for the following code by using basic path testing. a) Draw CFG. c) d) int test_prime() { int x=1,n,i; } How many basic paths for the CFG? List the basic paths. Generate test cases from it. } scanf("%d",&n); if(n==2) else printf("prime"); for(i=2;i
What does the following code do? In [1]: def mystery (a, b) : if b == 1: return a else: return a + mystery (a, b - 1) In [2]: mystery (2, 10) Out [2]: ?????
What is the value of the variable ss after the following code is executed? int x[ 7 ] = (5,10,3,0,-10, 4); int ss=0; for (int i=1;i<=6; i++) { ss+=x[i]; cout<