Concept drill
logarithmic time
GATE CSE & IT · Complexity Theory · 2007-2018
2
PYQs
100%
keyed
1
elite explanations
2
years appeared
Study anchor
Cormen et al. — Introduction to Algorithms (CLRS)
Algorithms, data structures, graph algorithms, complexity
Practice action
Start latest PYQPYQs in this concept
All concepts →2018 PYQ
Consider the following C code. Assume that unsigned long int type length is 64 bits. unsigned long int fun(unsigned long int n){ unsigned long int i, j = 0, sum = 0; for (i = n; i...
easyanswer key
2007 PYQ
Consider the following segment of C-code: int j, n; j=1; while(j <= n) j = j * 2; The number of comparisons made in the execution of the loop for any n > 0 is:
easyanswer keyelite explanation