Merge pull request #3 from Vishakhasarode/main

created bubblesort algorithm using cpp

data-structure/bubble sort.cpp

@@ -0,0 +1,18 @@
+#include <bits/stdc++.h>
+using namespace std;
+void bubbleSort(int arr[], int n)
+{
+    for (int i = 0; i < n - 1; i++)
+        for (int j = 0; j < n - i - 1; j++)
+            if (arr[j] > arr[j + 1])
+                swap(arr[j], arr[j + 1]);
+}
+int main()
+{
+    int arr[5] = {5, 2, 7, 9, 1};
+    int n = sizeof(arr) / sizeof(int);
+    bubbleSort(arr, n);
+    for (int i = 0; i < n; i++)
+        cout << arr[i] << " ";
+    return 0;
+}