Which sorting algorithm is LEAST effective when it is run on an array in which the values ​​are already in the desired sort order?

Of the 4, the least efficient sorting method when the values ​​are already sorted:

Binary

Merge

Insertion

Selection