In this example we are going to sort integer values of an array using odd
even transposition sort.
Odd even transposition sort is a parallel sorting algorithm. Odd Even is based on the Bubble Sort technique of comparing two numbers and swapping them and put higher value at larger index .In each parallel computational steps can pair off either the odd or even neighboring pairs. Each number (In Processing Element-PE) would look to it's right neighbor and if it were greater, it would swap them.
The odd even transposition sort is a parallel sorting algorithm. That mean more than one compression can made at one iteration. The comparison is same as bubble sort.
Working of odd even transposition sort:
The code of the program :
Output of the example:
Odd Even Transposition Sort
Values Before the sort:
12 9 4 99 120 1 3 10 13 Values after the sort: 1 3 4 9 10 12 13 99 120 PAUSE
If you are facing any programming issue, such as compilation errors or not able to find the code you are looking for.
Ask your questions, our development team will try to give answers to your questions.