The following is the ____ algorithm.
Access the first item from both sequences.
While not finished with either sequence
Compare the current items from the two sequences, copy the smaller current item to the output sequence, and
Access the next item from the input sequence whose item was copied
Copy any remaining items from the first sequence to the output sequence.
Copy any remaining items from the second sequence to the output sequence.
A) Shell sort
B) Selection sort
C) Merge sort
D) Heapsort

Question

Quizplus · Accepted Answer

The described algorithm is the merge step of the Merge Sort algorithm, where two sorted sequences are merged into a single sorted sequence by repeatedly comparing the smallest elements of each and moving the smallest to the output sequence.

The Following Is the ____ Algorithm