Merge sort uses ?

A. Divide and conquer strategy

B. Backtracking approach

C. Heuristic search

D. Greedy approach

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

You can do it
  1. Which of the following data structure store the homogeneous data elements?
  2. Which of the following data structure can't store the non-homogeneous data elements?
  3. Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…
  4. Which of the following statement is false?
  5. Which data structure is used in breadth first search of a graph to hold nodes?
  6. The memory address of fifth element of an array can be calculated by the formula
  7. Which of the following statement is true ?
  8. Which data structure allows deleting data elements from and inserting at rear?
  9. Identify the data structure which allows deletions at both ends of the list but insertion at only one…
  10. Finding the location of the element with a given value is:
  11. Which of the following is not a limitation of binary search algorithm?
  12. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
  13. Which of the following case does not exist in complexity theory
  14. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…
  15. Linked list are not suitable data structure of which one of the following problems ?
  16. Two main measures for the efficiency of an algorithm are
  17. The elements of an array are stored successively in memory cells because
  18. Linked lists are best suited
  19. Merge sort uses ?
  20. Which of the following name does not relate to stacks?
  21. Which of the following data structure is linear type?
  22. The term push and pop is related to the
  23. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called…
  24. Which if the following is/are the levels of implementation of data structure
  25. The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort…
  26. Which of the following algorithm design technique is used in the quick sort algorithm?
  27. Which of the following is true about the characteristics of abstract data types? i) It exports a type.…
  28. The situation when in a linked list START=NULL is
  29. Two dimensional arrays are also called
  30. ______ is very useful in situation when data have to stored and then retrieved in reverse order.