Which of the following is not a limitation of binary search algorithm?

A. must use a sorted array

B. requirement of sorted array is expensive when a lot of insertion and deletions are needed

C. there must be a mechanism to access middle element directly

D. binary search algorithm is not efficient when the data elements are more than 1000.

Please do not use chat terms. Example: avoid using "grt" instead of "great".

You can do it
  1. Which of the following data structure cant store the non-homogeneous data elements?
  2. Which of the following is true about the characteristics of abstract data types? i) It exports a type.…
  3. If the values of a variable in one module is indirectly changed by another module, this situation is…
  4. Merge sort uses ?
  5. Inserting an item into the stack when stack is not full is called _______ Operation and deletion of…
  6. When new data are to be inserted into a data structure, but there is no available space; this situation…
  7. Which of the following data structure can't store the non-homogeneous data elements?
  8. In linear search algorithm the Worst case occurs when
  9. The operation of processing each element in the list is known as
  10. Which data structure is used in breadth first search of a graph to hold nodes?
  11. Linked list are not suitable data structure of which one of the following problems ?
  12. The Average case occur in linear search algorithm
  13. The memory address of the first element of an array is called
  14. The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a…
  15. For an algorithm the complexity of the average case is
  16. The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort…
  17. Which of the following data structure is linear type?
  18. The complexity of merge sort algorithm is
  19. Finding the location of the element with a given value is:
  20. To represent hierarchical relationship between elements, Which data structure is suitable?
  21. Which of the following algorithm design technique is used in the quick sort algorithm?
  22. A data structure where elements can be added or removed at either end but not in the middle
  23. The memory address of fifth element of an array can be calculated by the formula
  24. Which data structure allows deleting data elements from and inserting at rear?
  25. Arrays are best data structures
  26. ______ is very useful in situation when data have to stored and then retrieved in reverse order.
  27. Which one of the following permutations can be obtained the output using stack assuming that the input…
  28. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
  29. Two dimensional arrays are also called
  30. Which of the following data structure is linear data structure?