Q. Choose the recursive formula for the Fibonacci series.(n>=1)

View solution

Q. What is the time complexity of Fibonacci Search?

View solution

Q. What are the advantages of Fibonacci Search?

View solution

Q. What is the length of the step in jump search?

View solution

Q. What is the time complexity of Jump Search?

View solution

Q. What is an in-place sorting algorithm?

View solution

Q. In the following scenarios, when will you use selection sort?

View solution

Q. What is the worst case complexity of selection sort?

View solution

Q. What is the advantage of selection sort over other sorting techniques?

View solution

Q. What is the average case complexity of selection sort?

View solution

Q. What is the disadvantage of selection sort?

View solution

Q. The given array is arr = {3,4,5,2,1}. The number of iterations in bubble sort and selection sort respectively are,

View solution

Q. The given array is arr = {1,2,3,4,5}. (bubble sort is implemented with a flag variable)The number of iterations in selection sort and bubble sort respectively are,

View solution

Q. What is the best case complexity of selection sort?

View solution

Q. What is an external sorting algorithm?

View solution

Q. What is an internal sorting algorithm?

View solution

Q. What is the worst case complexity of bubble sort?

View solution

Q. What is the average case complexity of bubble sort?

View solution

Q. What is the advantage of bubble sort over other sorting techniques?

View solution

Q. The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array?

View solution