From f499342869a096161770e9c16b65afff66775e54 Mon Sep 17 00:00:00 2001
From: Vaibhav Gupta <vaibhavgupta40@gmail.com>
Date: Tue, 2 Oct 2018 16:34:16 +0530
Subject: [PATCH] Optimize bubble sort algorithm

-introduced variable 'swap' for 'outer-for-loop' of bubble sort algorithm. If it remains zero after executing inner-loop, it means array is sorted, hence it does not need to run for n^2 times.
- 'for(int j=0; j<n-1-i; j++)', as after each step, one number reaches to its right position. Thus inner loop does not need to run for 'n' times in every cycle.
---
 Sorting/Bubble Sort.cpp | 11 +++++++++--
 1 file changed, 9 insertions(+), 2 deletions(-)

diff --git a/Sorting/Bubble Sort.cpp b/Sorting/Bubble Sort.cpp
index c94a45efc..21402f334 100644
--- a/Sorting/Bubble Sort.cpp	
+++ b/Sorting/Bubble Sort.cpp	
@@ -6,9 +6,10 @@ using namespace std;
 int main()
 {
 	int n;
+	short swap=0;
 	cin >> n;
 	int Array[n];
-	cout<<"\nEnter any 6 Numbers for Unsorted Array : ";
+	cout<<"\nEnter any "<<n<<" Numbers for Unsorted Array : ";
 
 	//Input
 	for(int i=0; i<n; i++)
@@ -19,15 +20,21 @@ int main()
 	//Bubble Sorting
 	for(int i=0; i<n; i++)
 	{
-		for(int j=0; j<n-1; j++)
+		swap=0;
+		for(int j=0; j<n-1-i; j++)
 		{
 			if(Array[j]>Array[j+1])
 			{
+				swap=1;
 				int temp=Array[j];
 				Array[j]=Array[j+1];
 				Array[j+1]=temp;
 			}
 		}
+		if(swap == 0)
+		{	
+			break;
+		}
 	}
 
 	//Output