Bubble sort code added

Author: me-shaon

.gitignore

@@ -0,0 +1,5 @@
+#Intro
+
+
+### Primitive types or data structures in Python
+Integer, Float, Boolean, Char 

README.md

@@ -0,0 +1,8 @@
+# Bubble Sort
+
+**Bubble Sort** is an algorithm which is used to sort **N** elements that are given in a memory for eg: an Array with N number of elements. Bubble Sort compares all the element one by one and sort them based on their values.
+
+It is called Bubble sort, because *with each iteration the smaller element in the list bubbles up towards the first place*, just like a water bubble rises up to the water surface.
+
+Sorting takes place by stepping through all the data items one-by-one in pairs and comparing adjacent data items and swapping each pair that is out of order.
+![bubble sort demonstration](bubble-sort.png)

Sorting/Bubble Sort/README.md

@@ -0,0 +1,48 @@
+# Python program for implementation of Bubble Sort
+
+def bubbleSort(arr):
+	n = len(arr)
+
+	# Traverse through all array elements
+	for i in range(n):
+
+		# Last i elements are already in place, so the inner loops will run until it reaches the last i elements
+		for j in range(0, n-i-1):
+
+			# traverse the array from 0 to n-i-1
+			# Swap if the element found is greater than the next element
+			if arr[j] > arr[j+1] :
+				arr[j], arr[j+1] = arr[j+1], arr[j]
+
+
+def modifiedBubbleSort(arr):
+	n = len(arr)
+
+	# Traverse through all array elements
+	for i in range(n):
+        # Taking a flag variable
+		flag = 0
+		# Last i elements are already in place
+		for j in range(0, n-i-1):
+
+			# traverse the array from 0 to n-i-1
+			# Swap if the element found is greater
+			# than the next element
+			if arr[j] > arr[j+1] :
+				arr[j], arr[j+1] = arr[j+1], arr[j]
+				# Setting the flag, if swapping occurs
+				flag = 1
+
+		# If not swapped, that means the list has already sorted
+		if flag == 0:
+		    break
+
+# Main code
+arr = [64, 34, 25, 12, 22, 11, 90]
+
+bubbleSort(arr)
+# modifiedBubbleSort(arr)
+
+print ("Sorted array is:")
+for i in range(len(arr)):
+	print ("%d" %arr[i]),