List of practice Questions

When does the worst case of binary search occur?
Suppose that insertion sort is applied to the array \([1,2,3,5,7,9,11,x,15,13]\) and it takes exactly 2 swaps to sort the array. Select all possible values of \( x \).
Which of the following data structures supports binary search in \( O(\log n) \) time complexity?
Consider the following algorithm: 
algorithm
algorithm
 What will be the output (O/P) of this algorithm?
Consider the following graph with heuristic values: Which of the following represents the correct order of node expansion using the A* search algorithm?