Merge pull request #13 from srksumanth/comb-sort

Improve code and update shrink factor

sorting/comb_sort.go

@@ -9,37 +9,24 @@ import "fmt"
 import "github.com/0xAX/go-algorithms"
 
 func main() {
-    arr := utils.RandArray(10)
-    fmt.Println("Initial array is:", arr)
-    fmt.Println("")
-
-    tmp := 0
-    gap := len(arr)
-
-    for {
-        if gap > 1 {
-            gap = gap * 100 / 124
-        }
-
-        for i := 0 ; ; {
-
-            if arr[i] > arr[i + gap]  {         
-                tmp = arr[i]
-                arr[i] = arr[i + gap]
-                arr[i + gap] = tmp              
-            }
+	arr := utils.RandArray(10)
+	fmt.Println("Initial array is:", arr)
+	fmt.Println("")
 
-            i++
-
-            if i + gap >= len(arr){
-                break
-            }
-        }
+	tmp := 0
+	arrLen := len(arr)
+	gap := arrLen
+	for gap > 1 {
+		gap = gap * 10 / 13 //shrink factor is 1.3
 
-        if gap == 1 {
-            break
-        }
-    }
+		for i := 0; i+gap < arrLen; i++ {
+			if arr[i] > arr[i+gap] {
+				tmp = arr[i]
+				arr[i] = arr[i+gap]
+				arr[i+gap] = tmp
+			}
+		}
+	}
 
-    fmt.Println("Sorted array is: ", arr)
+	fmt.Println("Sorted array is: ", arr)
 }