[Solved] Which of the following is true?

McqMate

Q.	Which of the following is true?
A.	Shell sort’s passes completely sort the elements before going on to the next-smallest gap while Comb sort’s passes do not completely sort the elements
B.	Shell sort’s passes do not completely sort the elements before going on to the next-smallest gap like in Comb sort
C.	Comb sort’s passes completely sort the elements before going on to the next-smallest gap like in Shell sort
D.	Shell sort’s passes do not completely sort the elements before going on to the next-smallest gap while Comb sort’s passes completely sort the elements
Answer» A. Shell sort’s passes completely sort the elements before going on to the next-smallest gap while Comb sort’s passes do not completely sort the elements

1.6k

0

Do you find this helpful?

9

View all MCQs in

Data Structures (DS)

Discussion

No comments yet

Related MCQs

Suppose implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in addition to the PUSH and POP instructions. Which one of the following statements is TRUE with respect to this modified stack?
For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?
Which of the following statement is true? i) Using singly linked lists and circular list, it is not possible to traverse the list backwards. ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.
Which of the following is true?
For the given graph(G), which of the following statements is true?
Which of the following is true?
If there are more than 1 topological sorting of a DAG is possible, which of the following is true.
Which of the following is true for the LSD radix sort?
Which of the following is true while inserting a new node in the list?
Suppose you are given an implementation of a queue of integers. The operations that can be performed on the queue are: i. isEmpty (Q) — returns true if the queue is empty, false otherwise. ii. delete (Q) — deletes the element at the front of the queue and returns its value. iii. insert (Q, i) — inserts the integer i at the rear of the queue. Consider the following function: void f (queue Q) { int i ; if (!isEmpty(Q)) { i = delete(Q); f(Q); insert(Q, i); } }What operation is performed by the above function f ?