What can be concluded about a sorting algorithm (such as insertion) that performs only adjacent interchanges?

It is the most critical part in algorithm. This is to sort or arrange things or numbers in specific characteristics. This is to make things easier when you will be calculating and you can differentiate the results and your variable being considered in solving the problem.