Describe the complexity of Binary search, Quicksort and various other sorting and searching techniques..


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More C Interview Questions

What does %d do in c?

0 Answers  


Why static variable is used in c?

0 Answers  


How can I call a function with an argument list built up at run time?

0 Answers  


int zap(int n) { if(n<=1)then zap=1; else zap=zap(n-3)+zap(n-1); } then the call zap(6) gives the values of zap [a] 8 [b] 9 [c] 6 [d] 12 [e] 15

10 Answers   Wipro,


write a program to swap bits in a character and return the value prototype of function char fun (char a, charb flag c) where fun returns a char, char a is a the value char b is the bit to be changed and flag c is the bit value for eg: x=fun(45,7,0) since 45 is 0010 0101 and ow x should contain the value 65 (0110 0101)

1 Answers   Bosch, College School Exams Tests,






can we declare a function inside the structure? ex: struct book { int pages; float price; int library(int,float); }b; is the above declaration correct? as it has function declaration?

2 Answers  


C program to find frequency of each character in a text file?

6 Answers  


Are bit fields portable?

0 Answers   EXL,


Is printf a keyword?

0 Answers  


What is volatile variable in c with example?

0 Answers  


write a C code to reverse a string using a recursive function, without swapping or using an extra memory.

9 Answers   Motorola, TCS, Wipro,


Can 'this' pointer by used in the constructor?

0 Answers  


Categories