why nlogn is the lower limit of any sort algorithm?
No Answer is Posted For this Question
Be the First to Post Answer
main() { void swap(); int x=10,y=8; swap(&x,&y); printf("x=%d y=%d",x,y); } void swap(int *a, int *b) { *a ^= *b, *b ^= *a, *a ^= *b; }
Write out a function that prints out all the permutations of a string. For example, abc would give you abc, acb, bac, bca, cab, cba. You can assume that all the characters will be unique.
5 Answers IITR, Microsoft, Nike,
void main() { int c; c=printf("Hello world"); printf("\n%d",c); }
main() { { unsigned int bit=256; printf("%d", bit); } { unsigned int bit=512; printf("%d", bit); } } a. 256, 256 b. 512, 512 c. 256, 512 d. Compile error
4. Main() { Int i=3,j=2,c=0,m; m=i&&j||c&I; printf(“%d%d%d%d”,I,j,c,m); }
Cau u say the output....?
why is printf("%d %d %d",i++,--i,i--);
To Write a C program to remove the repeated characters in the entered expression or in entered characters(i.e) removing duplicates. String contains only lowercase characters ['a'-'z']
char *someFun() { char *temp = “string constant"; return temp; } int main() { puts(someFun()); }
why array index always strats wuth zero?
#include<stdio.h> main() { const int i=4; float j; j = ++i; printf("%d %f", i,++j); }
Sorting entire link list using selection sort and insertion sort and calculating their time complexity
1 Answers Infosys, Microsoft, NetApp,