Interested to Buy Any Domain ? << Click Here >> for more details...
how to calculate the time complexity of a given algorithm?
pls give exaples..mainly for the coplexities such as O(log
n),O(n log n)...
- 1 Answers
- 8796 Views
- Infosys, I also Faced
- E-Mail Answers
Answer / s v s pradeep
Generally 0(log n) and 0(n log(n)) will come into picture
if u are dealing with the programs that have for loops
(where the increment is divided or multiplied), functional
blocks.
Eg. for(i=0;i<n;i=i++)
for(j=0;j<n;j=j*2)
......
Here in this case the inner loop complexity is 3n+2 where
the outer loop complexity will be in logarithm terms
because every time when we increment i value the, i is
multiplied by 2 so the no of iterations will be reduced ..
so when the iterations are reduced then we will get log(n)
so, for the above example the complexity will be 0(n log(n))
n-- for the outer loop and log(n) is for inner loop.
so multiply the no of times innerloop will be executed for
the outer loop. so n*log(n).
So the time complexity will be 0(n log(n)).
..
| Is This Answer Correct ? | 14 Yes | 7 No |
What is the heap in c?
What is a far pointer in c?
Explain what standard functions are available to manipulate strings?
how to write a data 10 in address location 0x2000
How can you read a directory in a C program?
why do we use pointer instead directly acessing the data?
Why string is used in c?
When should a far pointer be used?
Is there a way to jump out of a function or functions?
What is static identifier?
How many levels of indirection in pointers can you have in a single declaration?
0 Answers Agilent, ZS Associates,
Find MAXIMUM of three distinct integers using a single C statement
C 
