Question

which of the sorting methods are stable?
a. straight insertion sort
b. binary insertion sort
c. shell sort
d. heap sort
​

Answer 1

Explanation:

b) binary insertion sort

hope it helps you

Answer 2

Answer:

Which of the sorting methods are stable?

a. straight insertion sort

b. binary insertion sort

c. shell sort

d. heap sort

Explanation:

• Binary insertion sort is stable. In binary insertion sort, we divide the array into two sub arrays. The two sub arrays are- sorted array and unsorted array.
• The first elements of the array is in the sorted array and rest of the elements are in the unsorted array.
• It has quadratic time complexity. Binary search is an elements position in a sorted array.
• Sorting methods- It is the computer science, a sorting algorithm is an algorithm which puts elements of a list into an order.
• There are different types of sorting methods are- insertion sort, merge sort, quicksort, counting sort, radix sort, bucket sort, heap sort, shell sort.
• Sorting often reduce the complexity of the problem.
• This algorithm have direct applications in searching algorithms.
• So from given options, options b that is binary insertion sort is correct answer.

Hence, the answer is option number b.

#SPJ6