From 4cecb97371e0a2e423cd96c6c21e78c2d6e8c37e Mon Sep 17 00:00:00 2001
From: Pawan Bangar <34831511+pawanbangar@users.noreply.github.com>
Date: Thu, 31 Oct 2019 18:41:30 +0530
Subject: [PATCH] Update main.c

Added Some logical and informative therotical information.
---
 C/Bubble Sort/main.c | 6 ++++--
 1 file changed, 4 insertions(+), 2 deletions(-)

diff --git a/C/Bubble Sort/main.c b/C/Bubble Sort/main.c
index 1b4ebe5..439bdb5 100644
--- a/C/Bubble Sort/main.c	
+++ b/C/Bubble Sort/main.c	
@@ -3,7 +3,9 @@
 /*
 	The Bubble Sort is just one of many methods out there to "sort lists of data".  It is
 	certainly NOT the fastest method, but it's pretty simple to implement and if you don't need
-	a blazing fast sort routine, it will get the job done.
+	a blazing fast sort routine, it will get the job done Logic behind this is When you have bubbles
+	the big bubble will have more air and will go up than the smmaller one similarly here after every
+	loop Big number goes to right till completion.
 
 	The Bubble Sort works like this:
 
@@ -140,5 +142,5 @@ void BubbleSort(int *numArray, int num, bool l2g)
 
 /*-------------------------*\
 |  Programmed by:  TheTutor	|
-|  ©2006 GameTutorials, LLC	|
+|  ©2006 GameTutorials, LLC	|
 \*-------------------------*/