Register

 what is the running time of the following iterative algorithm? b) It is possible to talk about the best, average and worst running times for this algorithm. Why?

• edited by
545 views
0 votes
0 votes
  1.  what is the running time of the following iterative algorithm?
    b) It is possible to talk about the best, average and worst running times for this algorithm. Why?

 

pseudo code

Ci

The number of repetitions

ci × Number of repetitions

for i=1 to n

 

 

 

do

 

 

 

j=1;

 

 

 

While (j<n)

 

 

 

do

 

 

 

j=j*2;

 

 

 

                         

                                                Total:

 

T(n)=

 
           

 

• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

295
views
0 answers
0 votes
usdid asked Apr 16, 2022
295 views
a) what is the iterative equation showing the running time of the algorithm whose pseudocode is given below? b) What is this repeated equation in asymptotic notation using the Master's theorem. c) What is the same repeated equation in asymptotic notation using the recursion tree method.
a) what is the iterative equation showing the running time of the algorithm whose pseudocode is given below? b) What is this repeated equation in asymptotic notation using the Master' ... 0 for i=1 ton do total = total + i*i print total
User Avatar
261
views
0 answers
0 votes
usdid asked Apr 16, 2022
261 views
what is the running time of the following iterative algorithm?
1 question:a) Calculate the running time of the following iterative algorithm. For this purpose, write the working time of each row in the corresponding column of the table in terms of ci ... Total: T(n)=
User Avatar
5.1k
views
1 answers
0 votes
Sanjay Sharma asked Jun 8, 2016
5,081 views
Which algorithm has same average, worst case and best case time
Which algorithm has same average, worst case and best case time ?Binary searchMaximum of n numberQuick sortFibonacci search
User Avatar
866
views
1 answers
0 votes
LavTheRawkstar asked Jan 12, 2017
866 views
General doubt on calculating the Time complexity for the given Insertion Sort Algorithm in the worst and average case
INSERTION-SORT (A, n) ⊳ A[1 . . n]for (j ← 2 to len(A) ){key ← A[ j];i ← j – 1 ; while (i > 0 and A[i] > key) { A[i+1] ← A[i]; i ← i – 1; }A[i+1] = key;
User Avatar
Link Copied!