From 50081e1b414d9a6200889b1fe5dc6851d1145eec Mon Sep 17 00:00:00 2001
From: Ashanpro <41038007+djashan@users.noreply.github.com>
Date: Tue, 17 Oct 2023 12:34:15 +0530
Subject: [PATCH] Create Bubble_sort.java

Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order
---
 Bubble_sort.java | 51 ++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 51 insertions(+)
 create mode 100644 Bubble_sort.java

diff --git a/Bubble_sort.java b/Bubble_sort.java
new file mode 100644
index 0000000..c06b0f0
--- /dev/null
+++ b/Bubble_sort.java
@@ -0,0 +1,51 @@
+// java implementation of Bubble sort
+
+import java.io.*;
+
+class GFG {
+	
+	// An optimized version of Bubble Sort
+	static void bubbleSort(int arr[], int n)
+	{
+		int i, j, temp;
+		boolean swapped;
+		for (i = 0; i < n - 1; i++) {
+			swapped = false;
+			for (j = 0; j < n - i - 1; j++) {
+				if (arr[j] > arr[j + 1]) {
+					
+					// Swap arr[j] and arr[j+1]
+					temp = arr[j];
+					arr[j] = arr[j + 1];
+					arr[j + 1] = temp;
+					swapped = true;
+				}
+			}
+
+			// If no two elements were
+			// swapped by inner loop, then break
+			if (swapped == false)
+				break;
+		}
+	}
+
+	// Function to print an array
+	static void printArray(int arr[], int size)
+	{
+		int i;
+		for (i = 0; i < size; i++)
+			System.out.print(arr[i] + " ");
+		System.out.println();
+	}
+
+	// Driver program
+	public static void main(String args[])
+	{
+		int arr[] = { 64, 34, 25, 12, 22, 11, 90 };
+		int n = arr.length;
+		bubbleSort(arr, n);
+		System.out.println("Sorted array: ");
+		printArray(arr, n);
+	}
+}
+