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   Infosys,

---

How can we open a file in Binary mode and Text mode?what is the difference?

1 Answers   PanTerra,

---

write a program to find the given number is prime or not

2 Answers   Accenture, Vasutech,

---

const char * char * const What is the differnce between the above tow?.

6 Answers   Ramco, TCS,

---

#&#8206;include&#8236;<stdio.h> void main() { int i; for(i=5;0;i++) { printf("%d",i); } }

2 Answers   Facebook,

---

---

The differences between Windows XP and Windows Visa

8 Answers   HCL,

---

#include<stdio.h> main() {int i=1;j=1; for(;;) {if(i>5) break; else j+=1; printf("\n%d",j) i+=j; } }

7 Answers   HCL,

---

I heard that you have to include stdio.h before calling printf. Why?

0 Answers  

---

What math functions are available for integers? For floating point?

0 Answers  

---

what about "char *(*(*a[])())();"

3 Answers   Oracle,

---

what is stack , heap ,code segment,and data segment

0 Answers  

---

#include<stdio.h> #include<conio.h> # define swap(a,b) temp=a; a=b; b=temp; void main( ) { int i, j, temp; i=5; j=10; temp=0; if( i > j) swap( i, j ); printf( "%d %d %d", i, j, temp); }

9 Answers   Burning Glass,

---