Which of the following sorting algorithms is described by this text? "Take the item at index 1 and see if it is in order compared to the item at index 0. If it is not, then swap the two items. Next take the item at index 2 and compare it to the items at the lower indexes. Move items in the lower indexes to a higher one until you find the proper location to place the value so that it is in the correct order. Continue this process with all remaining indexes."

a. Insertion sort

b. Heap sort

c. Merge sort

d. Quick sort

e. Selection sort

Question

Billy Duffy

Computers & Technology

19 February, 09:20

Which of the following sorting algorithms is described by this text? "Take the item at index 1 and see if it is in order compared to the item at index 0. If it is not, then swap the two items. Next take the item at index 2 and compare it to the items at the lower indexes. Move items in the lower indexes to a higher one until you find the proper location to place the value so that it is in the correct order. Continue this process with all remaining indexes."

a. Insertion sort

b. Heap sort

c. Merge sort

d. Quick sort

e. Selection sort

+2

Answers (1)

Know the Answer?

Spirit · Answer 1

a. Insertion sort

Explanation:

Insertion Sort is a sorting algorithm that places the input element at its suitable place in each pass.

Insertion sort is based on the idea that one element from the input elements is consumed in each iteration to find its correct position.