HomeData Modelling & AIAlgorithms | Analysis of Algorithms (Recurrences) | Question 7

Algorithms | Analysis of Algorithms (Recurrences) | Question 7

The running time of the following algorithm

  Procedure A(n)  
  If n <= 2 return(1) else return A(\lceil \sqrt{n}  \rceil);

is best described by
(A) O(n)
(B) O(log n)
(C) O(1og log n)
(D) O(1)

Answer: (C)
Explanation: For explanation, please see question 5 of this post

Quiz of this Question

Whether you’re preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape, neveropen Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we’ve already empowered, and we’re here to do the same for you. Don’t miss out – check it out now!
RELATED ARTICLES

2 COMMENTS

Most Popular

Dominic
32686 POSTS0 COMMENTS
Milvus
131 POSTS0 COMMENTS
Nango Kala
7053 POSTS0 COMMENTS
Nicole Veronica
12193 POSTS0 COMMENTS
Nokonwaba Nkukhwana
12291 POSTS0 COMMENTS
Shaida Kate Naidoo
7179 POSTS0 COMMENTS
Ted Musemwa
7444 POSTS0 COMMENTS
Thapelo Manthata
7157 POSTS0 COMMENTS
Umr Jansen
7147 POSTS0 COMMENTS