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 are bps & baud rates? differentiate these two?

2 Answers   TCS,


What is c token?

0 Answers  


What is a pointer value and address in c?

0 Answers  


Write the following function in C. stripos — Find position of first occurrence of a case- insensitive string int stripos ( char* haystack, char* needle, int offset ) Returns the numeric position of the first occurrence of needle in the haystack string. Note that the needle may be a string of one or more characters. If needle is not found, stripos() will return -1. The function should not make use of any C library function calls.

4 Answers   OpenFeel,


two variables are added answer is stored on not for third variable how it is possible?

3 Answers  


write a progrmm in c language take user interface generate table using for loop?

0 Answers  


Is javascript based on c?

0 Answers  


Write a program to check palindrome number in c programming?

0 Answers  


YBJBU6

1 Answers  


Can you please explain the difference between syntax vs logical error?

0 Answers  


difference between semaphores and mutex?

1 Answers  


Explain what is wrong with this program statement?

0 Answers  


Categories