TECHNOLOGIES
FORUMS
JOBS
BOOKS
EVENTS
INTERVIEWS
Live
MORE
LEARN
Training
CAREER
MEMBERS
VIDEOS
NEWS
BLOGS
Sign Up
Login
No unread comment.
View All Comments
No unread message.
View All Messages
No unread notification.
View All Notifications
C# Corner
Post
An Article
A Blog
A News
A Video
An EBook
An Interview Question
Ask Question
Bi-Directional Bubble Sort in Java
Alagunila Meganathan
Sep 28, 2019
9.5
k
0
2
facebook
twitter
linkedIn
Reddit
WhatsApp
Email
Bookmark
In this Blog, I am going to explain the program for Bidirectional Bubble Sort in Java
BidirectionalBubbleSort.rar
Introduction
In this blog, I am going to explain the program for Bidirectional Bubble Sort in Java
Software Requirements
Java, Notepad
Programming
public
class
BidirectionalBubbleSort {
public
static
void
main(String a[]) {
int
i;
int
array[] = {
12
,
9
,
4
,
99
,
120
,
1
,
3
,
10
};
System.out.println(
"\n\n RoseIndia\n\n"
);
System.out.println(
" Selection Sort\n\n"
);
System.out.println(
"Values Before the sort:\n"
);
for
(i =
0
; i < array.length; i++)
System.out.print(array[i] +
" "
);
System.out.println();
bidirectionalBubble_srt(array, array.length);
System.out.print(
"Values after the sort:\n"
);
for
(i =
0
; i < array.length; i++)
System.out.print(array[i] +
" "
);
System.out.println();
System.out.println(
"PAUSE"
);
}
public
static
void
bidirectionalBubble_srt(
int
array[],
int
n) {
int
j;
int
st = -
1
;
while
(st < n) {
st++;
n--;
for
(j = st; j < n; j++) {
if
(array[j] > array[j +
1
]) {
int
T = array[j];
array[j] = array[j +
1
];
array[j +
1
] = T;
}
}
for
(j = n; --j >= st;) {
if
(array[j] > array[j +
1
]) {
int
T = array[j];
array[j] = array[j +
1
];
array[j +
1
] = T;
}
}
}
}
}
Output
Java
sort
Bubble Sort
Next Recommended Reading
Two Sum Array Problem In Java