Register

gatebook

358 views
1 1 vote

How option D?? It will be  1* log2 *log4 * log8 How it is equal to (lg(n))!

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · gatebookNext → · test series
← Previous in category · Ace Test Series: Pro...Next in category → · Complexity
Position:
Show:

Related questions

3 3 votes
0 0 answers
1.6k
1.6k views
Ayush Upadhyaya asked Nov 15, 2018
1,620 views
GATEBOOK-DSA4_8
Consider a sorted array A of n integer elements, A[0]...A[n − 1].A search operation is to be performed on this array using .Binary search algorithm. If the element being ...
0 0 votes
0 0 answers
425
425 views
Tridhara Chakrabarti asked Dec 12, 2017
425 views
Gatebook test
Consider the following code. int a = 1;int b = 1;Function foo() {print(a); }Function bar(int x, int y){int a = 0;foo() ;x = 0 ;b = b-y;r = Y+1;}Function foobar() {int r =...
1 1 vote
0 0 answers
767
767 views
biranchi asked Jan 24, 2017
767 views
Loop invariants [GateBook]
6 6 votes
2 answers 2 answers
2.2k
2.2k views
Sayan Das 1 asked Aug 27, 2016
2,151 views
Gatebook exam
Consider the following exponential search algorithm(ES). The array of n elements have to be searched is divided in to logn parts. The ith part is from index to. to searc...