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)).

..

What are the primitive data types in c?

0 Answers  

---

what is the difference between embedded c and turbo c ?

1 Answers  

---

What is a pointer in c?

3 Answers  

---

What is c mainly used for?

0 Answers  

---

What is the advantage of using #define to declare a constant?

0 Answers   Agilent, ZS Associates,

---

write an algorithm and a program to count the number of elements in a circularly singly linked list

1 Answers   Ignou,

---

Explain threaded binary trees?

0 Answers  

---

What is time complexity c?

0 Answers  

---

why TCS selected more student in the software field from all institution.

5 Answers   TCS,

---

why integer range between -327680to+32767

2 Answers  

---

Write a program in c to input a 5 digit number and print it in words.

11 Answers  

---

Is it possible to create recycle bin in mobiles?

2 Answers  

---