Quick sort uses ____ for implementation.

  1. Home
  2. Back

Question:
Quick sort uses ____ for implementation.

1. recursion.

2.traversal

3.heaps

4.queues

Posted Date:-2022-07-11 06:02:40

More MCQS Questions and answers

  1. A list that has no nodes is called________.
  2. A path P of length n from a node u to a node v is defined as a sequence of _________ nodes.
  3. A vertex of degree one is called __________
  4. An edge E is called _________ if it has identical endpoints.
  5. Divide and conquer is an important algorithm design paradigm based on _______.
  6. Each entry in a linked list is a called a_______________.
  7. In a graph G if e=(u,v), then u and v are called ___________.
  8. In a linked list the _________field contains the address of next element in the list.
  9. The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is
  10. The correctness of a divide and conquer algorithm is usually proved by _________.
  11. The possibility of two different keys k1 & k2 yielding the same hash address is called_______
  12. Which of the following is two way lists?
  13. ___ is finding a path/tour through the graph such that every vertex is visited exactly once.
  14. ______ is not a technique of tree traversal.
  15. _________ data structure is used to implement Depth First search.
  16. _________involves maintaining two tables in memory.
  17. . If every node u in G is adjacent to every other node v in G, A graph is said to be _______.
  18. A ______________ list is a header list where the node points back to the header node.
  19. A connected graph T without any cycles is called _____________.
  20. An algorithm that calls itself directly or indirectly is known as ____________.
  21. How do you instantiate an array in Java?
  22. How many pointers are necessarily changed for the insertion in a Linked List?
  23. Quick sort uses ____ for implementation.
  24. Selection sort and quick sort both fall into the same category of sorting algorithms._________ is thatcategory.
  25. The ____________ is used in an elegant sorting algorithm.
  26. The average number of key comparisons done in a successful sequential search in a list of length n is_________
  27. The data items in a record form a ________ structure which can be described by means of level numbers.
  28. The efficiency of a BFS algorithm is dependent on _______.
  29. The efficient searching algorithm for algorithm for a sorted array is _________.
  30. The sequence (1,1) (2,1) (3,1) (1,2) (2,2) (3,2) . . . .represents _________.
  31. The special list which consists of unused memory space is called __________.
  32. To insert a new node in linked list free node will be available in ___________.
  33. Uniform distribution of the hash address throughout the given set L is _________
  34. Which of the following is a correct way to declare a multidimensional array in Java?
  35. Which of the following is true while inserting a new node in the list?
Search
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!