diff --git a/Bubble_sort.c b/Bubble_sort.c
index 53c45d3..429282c 100644
--- a/Bubble_sort.c
+++ b/Bubble_sort.c
@@ -1,25 +1,19 @@
 #include<stdio.h>
-
 int main()
 {
 	int i,J,K,n,A[n],temp;
-	
 	printf("Enter number of elements in an array: ");
 	scanf("%d", &n);
-	
 	printf("\nEnter the elements in array:\n");
-	
 	for (i=0; i<=n-1; i++)
 	{
 		scanf("%d",&A[i]);
 	}
-
     printf("\nThe original array is:\n");
 	for (i=0; i<n; i++)
 	{
 		printf("%d ", A[i]);
 	}
-	
 	for(K=1; K<=n-1; K++)
 	{
 		for(J=0; J<=(n-K-1); J++)
@@ -32,13 +26,10 @@ int main()
 			}
 		}
 	}
-	
-	printf("\n\nThe sorted array is:\n");
+	printf("\n\nThe sorted array is:[\n");
 	for (i=0; i<n; i++)
 	{
-		printf("%d ", A[i]);
-	}
-	
+		printf("%d,", A[i]);
+	}printf("\b]");
     return 0;
-
 }
diff --git a/LeetCode  Solutions/75. Sort Colors/SortColorNew.py b/LeetCode  Solutions/75. Sort Colors/SortColorNew.py
new file mode 100644
index 0000000..5ebc4fe
--- /dev/null
+++ b/LeetCode  Solutions/75. Sort Colors/SortColorNew.py	
@@ -0,0 +1,15 @@
+# this solution is by 3 pointer 
+
+class Solution:
+    def sortColors(self, nums):
+        beg, mid, end = 0, 0, len(nums) - 1
+        while mid <= end:
+            if nums[mid] == 0:
+                nums[beg], nums[mid] = nums[mid], nums[beg]
+                mid += 1
+                beg += 1
+            elif nums[mid] == 2:
+                nums[mid], nums[end] = nums[end], nums[mid]
+                end -= 1
+            else:  #nums[mid] == 1:
+                mid += 1