Question

which of the following sorting method would be most suitable for sorting a list which is almost sorted​

Answer 1

Bubble sort would be most suitable for sorting a list which is almost sorted. Bubble sort is a type of sorting.

Answer 2

Answer:

Many sorting algorithms are available, but the one which is best suited for the almost sorted array is the insertion sort.

The best case running time of the insertion sort is O(n)