Find the best big-O notation to describe the complexity of following algorithms: The number of print...

Question

Question

Find the best big-O notation to describe the complexity of following algorithms:
- The number of print statements in the following

while n>1 {

print “hello”

n=n/2

}

Answer 1

Answer #1

wh de (n>1) Poind hello pleridy time T (M)= T()O1) TW-1 T T() +2K 3K mk 1 2m T(n)= T) n T(n) Cm =17 T6)0Lip) T-04y)

Answer 2

Similar Homework Help Questions

Find the best big-O notation to describe the complexity of following algorithms: – A binary search...

Find the best big-O notation to describe the complexity of following algorithms: – A binary search of n elements – A linear search to find the smallest number in a list of n numbers
find complexity Problem 1 Find out the computational complexity (Big-Oh notation) of the code snippet: Code...

find complexity Problem 1 Find out the computational complexity (Big-Oh notation) of the code snippet: Code 1: for (int i = n; i > 0; i /= 2) { for (int j = 1; j < n; j *= 2) { for (int k = 0; k < n; k += 2) { // constant number of operations here } } } Code 2: Hint: Lecture Note 5, Page 7-8 void f(int n) { if (n...
13) Find the exact complexity, counting each assignment and comparison and also the Big O notation...

13) Find the exact complexity, counting each assignment and comparison and also the Big O notation For (i=0; i<n; i++) For (j=3; j<n; j++) a=a+b;

Which big-O expression best characterizes the worst case time complexity of the following code? public static...

Which big-O expression best characterizes the worst case time complexity of the following code? public static int foo(int N) ( int count = 0; int i1; while (i <N) C for (int j = 1; j < N; j=j+2) { count++ i=i+2; return count; A. O(log log N) B. O(log N2) C. O(N log N) D. O(N2)
Need to find number of elementary expressions in terms of n, not looking for Big O...

Need to find number of elementary expressions in terms of n, not looking for Big O complexity. 4. Work out the number of elementary operations in the worst possible case and the best possible case for the following algorithm (justify your answer): 0: function Nonsense (positive integer n) 1: it1 2: k + 2 while i<n do for j+ 1 to n do if j%5 = 0 then menin else while k <n do constant number C of elementary operations...
Describe the order of magnitude of the following code section using Big(O) notation j = 1;...

Describe the order of magnitude of the following code section using Big(O) notation j = 1; While (j < N) { j = j * 2); } Can someone give me a more Clearer answer please.

(10') 6. For each of the following code blocks, write the best (tightest) big-o time complexity...

(10') 6. For each of the following code blocks, write the best (tightest) big-o time complexity i) for (int i = 0; ǐ < n/2; i++) for (int j -0: ni j++) count++ i) for (int í = 0; i < n; i++) for (int ni j0 - for (int k j k ni kt+) count++ İİİ) for (int í ー 0; i < n; i++) for(int j = n; j > 0; j--) for (int k = 0; k...
C++ data strucs algorithms Big O SECTION List appropriate Worst Case Big O Notation under the...

C++ data strucs algorithms Big O SECTION List appropriate Worst Case Big O Notation under the different algorithms or data structure operations. Choose from right column and place under left column. Right column can be used more than once or not all.
How to compute/prove average case complexity for sorting algorithms? I have to compute the best case,...

How to compute/prove average case complexity for sorting algorithms? I have to compute the best case, worst case and average case time complexity for various sorting algorithms. I am ok with identifying the basic operations and proving the number of basic operations for best and worst case. However, I am at a loss of how to compute/prove the average case for these sorting algorithms. For example I can find in sources that the average case of say Shaker Sort and...