Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Create bubbleSort.java #6

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
49 changes: 49 additions & 0 deletions 1_Arrays/bubbleSort.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,49 @@
import java.util.*;
public class bubbleSort {

public static void bubble_sort(int arr[], int n){
for(int turn = 0; turn < n-1; turn++){
for(int j = 0; j < n-turn-1; j++){
if(arr[j] > arr[j+1]){
// swap
int temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}
}

public static void bubble_sort_optimized(int arr[], int n){
for(int turn = 0; turn < n-1; turn++){
int swaps = 0;
for(int j = 0; j < n-turn-1; j++){
if(arr[j] > arr[j+1]){
// swap
int temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
swaps++;
}
}
if(swaps == 0){
break;
} // this will break the loop if remaining array or full array is already sorted and will not run test cases for each iteraltion and each element.
}
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int arr[] = new int[n];
for(int i = 0; i < n; i++){
arr[i] = sc.nextInt();
}

bubble_sort_optimized(arr, n);

for(int i = 0; i < n; i++){
System.out.print(arr[i] + " ");
}
sc.close();
}
}