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 is the proper way of these job Tell me about there full work

0 Answers   EDS,

---

write a program to gat the digt sum of a number (et. 15= >1+5=6)

2 Answers  

---

What are the output(s) for the following ? #include char *f() {char *s=malloc(8); strcpy(s,"goodbye")} main() { char *f(); printf("%c",*f()='A'); }

0 Answers   Wilco,

---

What is the main differences between C and Embedded C?

9 Answers  

---

program to find a smallest number in an array

15 Answers   Microsoft, Sony,

---

Explain what is a program flowchart and explain how does it help in writing a program?

0 Answers  

---

Explain About fork()?

0 Answers   TISL,

---

what do structure language means?

3 Answers   Microsoft,

---

What is #include stdio h?

0 Answers  

---

What is the difference between declaring a variable and defining a variable?

0 Answers  

---

How do you determine if a string is a palindrome?

1 Answers  

---

Explain how to reverse singly link list.

0 Answers  

---