Skip to content

Commit dff1b63

Browse files
authored
Merge pull request #3 from manojchawan/brickSort-patch
brick sort
2 parents 0deadb7 + 2ead31b commit dff1b63

File tree

1 file changed

+54
-0
lines changed

1 file changed

+54
-0
lines changed

src/java/main/BrickSort.java

Lines changed: 54 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,54 @@
1+
// Java Program to implement
2+
// Odd-Even / Brick Sort
3+
import java.io.*;
4+
5+
class GFG
6+
{
7+
public static void oddEvenSort(int arr[], int n)
8+
{
9+
boolean isSorted = false; // Initially array is unsorted
10+
11+
while (!isSorted)
12+
{
13+
isSorted = true;
14+
int temp =0;
15+
16+
// Perform Bubble sort on odd indexed element
17+
for (int i=1; i<=n-2; i=i+2)
18+
{
19+
if (arr[i] > arr[i+1])
20+
{
21+
temp = arr[i];
22+
arr[i] = arr[i+1];
23+
arr[i+1] = temp;
24+
isSorted = false;
25+
}
26+
}
27+
28+
// Perform Bubble sort on even indexed element
29+
for (int i=0; i<=n-2; i=i+2)
30+
{
31+
if (arr[i] > arr[i+1])
32+
{
33+
temp = arr[i];
34+
arr[i] = arr[i+1];
35+
arr[i+1] = temp;
36+
isSorted = false;
37+
}
38+
}
39+
}
40+
41+
return;
42+
}
43+
public static void main (String[] args)
44+
{
45+
int arr[] = {34, 2, 10, -9};
46+
int n = arr.length;
47+
48+
oddEvenSort(arr, n);
49+
for (int i=0; i < n; i++)
50+
System.out.print(arr[i] + " ");
51+
52+
System.out.println(" ");
53+
}
54+
}

0 commit comments

Comments
 (0)