Would you rather wait for the results of a quicksort, a
linear search, or a bubble sort on a 200000 element array?
1) Quicksort
2) Linear Search
3) Bubble Sort
Answers were Sorted based on User's Feedback
Answer / bukke ramesh naik
quicksort is best one compare two others because quick sort
takes node lists
| Is This Answer Correct ? | 2 Yes | 3 No |
Explain how can you restore a redirected standard stream?
What is null pointer in c?
What happens if header file is included twice?
What does struct node * mean?
What do you mean by invalid pointer arithmetic?
what will the following program do? void main() { int i; char a[]="String"; char *p="New Sring"; char *Temp; Temp=a; a=malloc(strlen(p) + 1); strcpy(a,p); //Line no:9// p = malloc(strlen(Temp) + 1); strcpy(p,Temp); printf("(%s, %s)",a,p); free(p); free(a); } //Line no 15// a) Swap contents of p & a and print:(New string, string) b) Generate compilation error in line number 8 c) Generate compilation error in line number 5 d) Generate compilation error in line number 7 e) Generate compilation error in line number 1
#include main() { enum _tag{ left=10, right, front=100, back}; printf("left is %d, right is %d, front is %d, back is %d",left,right,front,back); }
Tell me what is the purpose of 'register' keyword in c language?
Which is better between malloc and calloc?
write a program to concatenation the string using switch case?
When can a far pointer be used?
what is the structure?