Data-Structures-Algorithms/Sorting/BubbleSort.java at master · priteshtripathi7/Data-Structures-Algorithms · GitHub

32 lines (28 loc) · 654 Bytes

import java.util.Scanner;

public class BubbleSort {

public static void bubbleSort(int[] arr) {

int temp = 0;

for (int i = 0; i < arr.length - 1; i++) {

for (int j = 0; j < arr.length - (i + 1); j++) {

if (arr[j] > arr[j + 1]) {

temp = arr[j];

arr[j] = arr[j + 1];

arr[j + 1] = temp;

}

public static void main(String[] args) {

Scanner s = new Scanner(System.in);

int size = s.nextInt();

int arr[] = new int[size];

for (int i = 0; i < arr.length; i++) {

arr[i] = s.nextInt();

}

bubbleSort(arr);

for (int i = 0; i < arr.length; i++) {

System.out.print(arr[i] + " ");

}

s.close();

}

Expand file tree