diff --git a/Array/BubbleSort.cpp b/Array/BubbleSort.cpp
new file mode 100644
index 0000000..d8048b0
--- /dev/null
+++ b/Array/BubbleSort.cpp
@@ -0,0 +1,55 @@
+// Optimized implementation of Bubble sort
+#include <bits/stdc++.h>
+using namespace std;
+void swap(int *xp, int *yp)
+{
+	int temp = *xp;
+	*xp = *yp;
+	*yp = temp;
+}
+
+// An optimized version of Bubble Sort
+void bubbleSort(int arr[], int n)
+{
+int i, j;
+bool 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], &arr[j+1]);
+		swapped = true;
+		}
+	}
+
+	// IF no two elements were swapped by inner loop, then break
+	if (swapped == false)
+		break;
+}
+}
+
+/* Function to print an array */
+void printArray(int arr[], int size)
+{
+	int i;
+	for (i = 0; i < size; i++)
+		cout <<" "<< arr[i];
+	cout <<" 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);
+	cout <<"Sorted array: \n";
+	printArray(arr, n);
+	return 0;
+}
+
+
+// This code is contributed by shivanisinghss2110