From 57bd918e5039d59917ead34a5c69d026940b40ed Mon Sep 17 00:00:00 2001
From: pragyeshjain <45493023+pragyeshjain@users.noreply.github.com>
Date: Sat, 19 Oct 2019 15:34:25 +0530
Subject: [PATCH] Create Bubble_sort.cpp

easiest way of sorting
---
 Bubble_sort.cpp | 27 +++++++++++++++++++++++++++
 1 file changed, 27 insertions(+)
 create mode 100644 Bubble_sort.cpp

diff --git a/Bubble_sort.cpp b/Bubble_sort.cpp
new file mode 100644
index 0000000..215bfdc
--- /dev/null
+++ b/Bubble_sort.cpp
@@ -0,0 +1,27 @@
+# BUBBLE_SORT
+
+// C++ program for implementation of Bubble sort 
+#include <bits/stdc++.h> 
+using namespace std;
+
+// A function to implement bubble sort 
+void bubbleSort(int arr[], int n) 
+{ 
+	int i, j; 
+	for (i = 0; i < n-1; i++)	 
+	
+	// Last i elements are already in place 
+	for (j = 0; j < n-i-1; j++) 
+		if (arr[j] > arr[j+1]) 
+			swap(&arr[j], &arr[j+1]); 
+} 
+ 
+int main() 
+{ 
+	int arr[] = {64, 34, 25, 12, 22, 11, 90};
+	int n = sizeof(arr)/sizeof(arr[0]); 
+	bubbleSort(arr, n); 
+	cout<<"Sorted array: \n"; 
+	for(int i=0;i<n;i++) cout<<arr[i]<<" "; 
+	return 0; 
+}