Question Detail Sort which compares adjacent elements in a list and switches where necessary is Insertion sortHeap sortQuick sortBubble sort Answer: Option D Similar Questions : 1. The complexity of Binary search algorithm is O(n)O(log n)O(n2)O(n log n) Answer: Option B 2. What are the minimum number of queues needed to implement the priority queue? OneTwoThreeFour Answer: Option BExplanation:One queue is used for the actual storing of data, and the other one is used for storing the priorities. 3. Which sorting method is slowest Quick sortHeap sortShell sortBubble sort Answer: Option D 4. Deletion from one end and insertion from other end is stackbranchtreequeue Answer: Option D 5. Which of the following name does not relate to stacks FIFO listsLIFO listPilesPush-down lists Answer: Option A Read more from - Data Structure Questions Answers - Chapter 1