From e346d7406ca6ff2ee1ae1e2f8503803dc0a23d1d Mon Sep 17 00:00:00 2001
From: akshyagarg0301 <72149344+akshyagarg0301@users.noreply.github.com>
Date: Thu, 1 Oct 2020 00:20:49 +0530
Subject: [PATCH] Create recursive_bubble_sort

---
 Bubble Sort/recursive_bubble_sort | 41 +++++++++++++++++++++++++++++++
 1 file changed, 41 insertions(+)
 create mode 100644 Bubble Sort/recursive_bubble_sort

diff --git a/Bubble Sort/recursive_bubble_sort b/Bubble Sort/recursive_bubble_sort
new file mode 100644
index 0000000..f45ae75
--- /dev/null
+++ b/Bubble Sort/recursive_bubble_sort	
@@ -0,0 +1,41 @@
+
+#include <bits/stdc++.h> 
+using namespace std; 
+  
+// A function to implement bubble sort 
+void bubbleSort(int arr[], int n) 
+{ 
+    // Base case 
+    if (n == 1) 
+        return; 
+  
+    // One pass of bubble sort. After 
+    // this pass, the largest element 
+    // is moved (or bubbled) to end. 
+    for (int i=0; i<n-1; i++) 
+        if (arr[i] > arr[i+1]) 
+            swap(arr[i], arr[i+1]); 
+  
+    // Largest element is fixed, 
+    // recur for remaining array 
+    bubbleSort(arr, n-1); 
+} 
+  
+/* Function to print an array */
+void printArray(int arr[], int n) 
+{ 
+    for (int i=0; i < n; i++) 
+        printf("%d ", arr[i]); 
+    printf("\n"); 
+} 
+  
+// Driver program to test above functions 
+int main() 
+{ 
+    int arr[] = {64, 34, 25, 12, 22, 11, 90}; 
+    int n = sizeof(arr)/sizeof(arr[0]); 
+    bubbleSort(arr, n); 
+    printf("Sorted array : \n"); 
+    printArray(arr, n); 
+    return 0; 
+}