Merge pull request #11 from srksumanth/work

Improve Bubble sort & Insertion sort

sorting/bubble_sort.go

@@ -9,21 +9,21 @@ import "fmt"
 import "github.com/0xAX/go-algorithms"
 
 func main() {
-    arr := utils.RandArray(10)
-    fmt.Println("Initial array is:", arr)
-    fmt.Println("")
-    
-    tmp := 0
-    
-    for i := 0; i < len(arr); i++ {
-        for j := 0; j < len(arr) - 1; j++ {
-            if arr[j] > arr[j + 1] {
-                tmp = arr[j]
-                arr[j] = arr[j + 1]
-                arr[j + 1] = tmp
-            }
-        }
-    }
-    
-    fmt.Println("Sorted array is: ", arr)
+	arr := utils.RandArray(10)
+	fmt.Println("Initial array is:", arr)
+	fmt.Println("")
+
+	tmp := 0
+
+	for i := 0; i < len(arr); i++ {
+		for j := 0; j < len(arr)-1-i; j++ {
+			if arr[j] > arr[j+1] {
+				tmp = arr[j]
+				arr[j] = arr[j+1]
+				arr[j+1] = tmp
+			}
+		}
+	}
+
+	fmt.Println("Sorted array is: ", arr)
 }

sorting/insertion_sort.go

@@ -19,8 +19,10 @@ func main() {
 
 	var i, j int
 	for i = 1; i < len(arr); i++ {
-		for j = i; j > 0 && arr[j] < arr[j-1]; j-- {
-			arr[j], arr[j-1] = arr[j-1], arr[j]
+		for j = 0; j < i; j++ {
+			if arr[j] > arr[i] {
+				arr[i], arr[j] = arr[j], arr[i]
+			}
 		}
 	}