This is basically a variation of bubble-sort. This algorithm is divided into two phases- Odd and Even Phase. The algorithm runs until the array elements are sorted and in each iteration two phases occurs- Odd and Even Phases. In the odd phase, we perform a bubble sort on odd indexed elements and in the even phase, we perform a bubble sort on even indexed elements.Â
Java
// Java Program to implement // Odd-Even / Brick Sort import java.io.*; Â
class GFG { Â Â Â Â public static void oddEvenSort( int arr[], int n) Â Â Â Â { Â Â Â Â Â Â Â Â boolean isSorted = false ; // Initially array is unsorted Â
        while (!isSorted) {             isSorted = true ;             int temp = 0 ; Â
            // Perform Bubble sort on odd indexed element             for ( int i = 1 ; i <= n - 2 ; i = i + 2 ) {                 if (arr[i] > arr[i + 1 ]) {                     temp = arr[i];                     arr[i] = arr[i + 1 ];                     arr[i + 1 ] = temp;                     isSorted = false ;                 }             } Â
            // Perform Bubble sort on even indexed element             for ( int i = 0 ; i <= n - 2 ; i = i + 2 ) {                 if (arr[i] > arr[i + 1 ]) {                     temp = arr[i];                     arr[i] = arr[i + 1 ];                     arr[i + 1 ] = temp;                     isSorted = false ;                 }             }         } Â
        return ;     }     public static void main(String[] args)     {         int arr[] = { 34 , 2 , 10 , - 9 };         int n = arr.length; Â
        oddEvenSort(arr, n);         for ( int i = 0 ; i < n; i++)             System.out.print(arr[i] + " "); Â
        System.out.println(" ");     } } // Code Contribute by Mohit Gupta_OMG <(0_o)> |
-9 2 10 34
Time Complexity : O(N2) where, N = Number of elements in the input array.
Auxiliary Space : O(1). This is an in-place algorithm, so no extra space is required.
Please refer complete article on Odd-Even Sort / Brick Sort for more details!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!