Algorithms - Sorting and Searching

6. For a linear search in an array of n elements the time complexity for the best, worst and average case are ......., ....... and ........ respectively

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


7. The average time required to perform a successful sequential search for an element in an array A(1 : n) is given by

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


8. Using the standard algorithm, what is the time required to determine that a number n is prime?

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


9. The average time required to perform a successful sequential search for an element in an array A (1 : n) is given by

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


10. Which of the following is false?

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *