Merge pull request #13 from srksumanth/comb-sort

Improve code and update shrink factor

sorting/comb_sort.go

@@ -14,30 +14,17 @@ func main() {
 	fmt.Println("")
 
 	tmp := 0
-    gap := len(arr)
+	arrLen := len(arr)
-    
+	gap := arrLen
-    for {
+	for gap > 1 {
-        if gap > 1 {
+		gap = gap * 10 / 13 //shrink factor is 1.3
-            gap = gap * 100 / 124
-        }
-        
-        for i := 0 ; ; {
 
+		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
 			}
-
-            i++
-            
-            if i + gap >= len(arr){
-                break
-            }
-        }
-
-        if gap == 1 {
-            break
 		}
 	}