Which of the following algorithm design technique is used in the quick sort algorithm?

A. Dynamic programming

B. Greedy method

C. Divide and conquer

D. Backtracking

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

You can do it
  1. Which of the following is two way list?
  2. Which data structure allows deleting data elements from and inserting at rear?
  3. Which of the following data structures are indexed structures?
  4. When determining the efficiency of algorithm, the space factor is measured by
  5. Which data structure is used in breadth first search of a graph to hold nodes?
  6. Stack is also called as
  7. The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a…
  8. The memory address of fifth element of an array can be calculated by the formula
  9. Which of the following data structure is not linear data structure?
  10. Which if the following is/are the levels of implementation of data structure
  11. The Average case occur in linear search algorithm
  12. The situation when in a linked list START=NULL is
  13. Which of the following is true about the characteristics of abstract data types? i) It exports a type.…
  14. Which of the following statement is false?
  15. Inserting an item into the stack when stack is not full is called _______ Operation and deletion of…
  16. In linear search algorithm the Worst case occurs when
  17. Which of the following is not the part of ADT description?
  18. The difference between linear array and a record is
  19. Which one of the following permutations can be obtained the output using stack assuming that the input…
  20. The complexity of Bubble sort algorithm is
  21. Which of the following data structure cant store the non-homogeneous data elements?
  22. The elements of an array are stored successively in memory cells because
  23. Arrays are best data structures
  24. Identify the data structure which allows deletions at both ends of the list but insertion at only one…
  25. Herder node is used as sentinel in ____
  26. A data structure where elements can be added or removed at either end but not in the middle
  27. Which of the following data structure store the homogeneous data elements?
  28. Which of the following is not the required condition for binary search algorithm?
  29. Which of the following is non-liner data structure?
  30. A variable P is called pointer if