why nlogn is the lower limit of any sort algorithm?

void main() { int const * p=5; printf("%d",++(*p)); }

Infosys, Made Easy, State Bank Of India SBI,

main() { char s[ ]="man"; int i; for(i=0;s[ i ];i++) printf("\n%c%c%c%c",s[ i ],*(s+i),*(i+s),i[s]); }

DCE,

main() { float me = 1.1; double you = 1.1; if(me==you) printf("I love U"); else printf("I hate U"); }

main() { static int var = 5; printf("%d ",var--); if(var) main(); }

main() { int c[ ]={2.8,3.4,4,6.7,5}; int j,*p=c,*q=c; for(j=0;j<5;j++) { printf(" %d ",*c); ++q; } for(j=0;j<5;j++){ printf(" %d ",*p); ++p; } }

main() { extern int i; i=20; printf("%d",i); }

Value Labs,

main() { int i=-1,j=-1,k=0,l=2,m; m=i++&&j++&&k++||l++; printf("%d %d %d %d %d",i,j,k,l,m); }

main() { char *p; printf("%d %d ",sizeof(*p),sizeof(p)); }

main() { int i=3; switch(i) { default:printf("zero"); case 1: printf("one"); break; case 2:printf("two"); break; case 3: printf("three"); break; } }

main() { printf("%x",-1<<4); }

HCL, Sokrati, Zoho,

main() { char string[]="Hello World"; display(string); } void display(char *string) { printf("%s",string); }

Wipro,

main() { int c=- -2; printf("c=%d",c); }

TCS,

#define int char main() { int i=65; printf("sizeof(i)=%d",sizeof(i)); }

main() { int i=10; i=!i>14; Printf ("i=%d",i); }