Most software today is very much like an Egyptian pyramid with millions of bricks piled on top of each other, with no structural integrity, but just done by brute force and thousands of slaves. Alan Kay

Exchange Sort

Language Java | Level Intermediate | Category Algorithms | August 3, 2015 7:59 am

Algorithm Problem Description

The exchange sort is a sorting algorithm that compares each item with other items of the array and swap the item if requires.

Sort the items by exchanging pairs of items until the sequence is sorted. In general, an algorithm may exchange adjacent elements as well as widely separated one.



Unsorted array before sorting: [12, 11, 13, 5, 6, 7]
Sorted array After Exchange Sort sorting: [5, 6, 7, 11, 12, 13]



Please login to add comments.