Fix test array generation

ua-nick · ua-nick · commit 560cb1289be7 · 2018-04-03T23:56:38.000+03:00
diff --git a/BinarySearch/BinarySearch_test.go b/BinarySearch/BinarySearch_test.go
@@ -18,7 +18,7 @@ func SortArray(array []int) {
 
 func TestBinarySearch(t *testing.T) {
 	random := rand.New(rand.NewSource(time.Now().UnixNano()))
-	array := make([]int, random.Intn(100))
+	array := make([]int, random.Intn(100-10)+10)
 	for i := range array {
 		array[i] = random.Intn(100)
 	}
diff --git a/BubbleSort/BubbleSort_test.go b/BubbleSort/BubbleSort_test.go
@@ -9,7 +9,7 @@ import (
 
 func TestBubbleSort(t *testing.T) {
 	random := rand.New(rand.NewSource(time.Now().UnixNano()))
-	array1 := make([]int, random.Intn(100))
+	array1 := make([]int, random.Intn(100-10)+10)
 	for i := range array1 {
 		array1[i] = random.Intn(100)
 	}
diff --git a/CocktailSort/CocktailSort_test.go b/CocktailSort/CocktailSort_test.go
@@ -9,7 +9,7 @@ import (
 
 func TestCocktailSort(t *testing.T) {
 	random := rand.New(rand.NewSource(time.Now().UnixNano()))
-	array1 := make([]int, random.Intn(100))
+	array1 := make([]int, random.Intn(100-10)+10)
 	for i := range array1 {
 		array1[i] = random.Intn(100)
 	}
diff --git a/CombSort/CombSort_test.go b/CombSort/CombSort_test.go
@@ -9,7 +9,7 @@ import (
 
 func TestCombSort(t *testing.T) {
 	random := rand.New(rand.NewSource(time.Now().UnixNano()))
-	array1 := make([]int, random.Intn(100))
+	array1 := make([]int, random.Intn(100-10)+10)
 	for i := range array1 {
 		array1[i] = random.Intn(100)
 	}
diff --git a/ExponentialSearch/ExponentialSearch_test.go b/ExponentialSearch/ExponentialSearch_test.go
@@ -18,7 +18,7 @@ func SortArray(array []int) {
 
 func TestExponentialSearch(t *testing.T) {
 	random := rand.New(rand.NewSource(time.Now().UnixNano()))
-	array := make([]int, random.Intn(100))
+	array := make([]int, random.Intn(100-10)+10)
 	for i := range array {
 		array[i] = random.Intn(100)
 	}
diff --git a/GnomeSort/GnomeSort_test.go b/GnomeSort/GnomeSort_test.go
@@ -9,7 +9,7 @@ import (
 
 func TestGnomeSort(t *testing.T) {
 	random := rand.New(rand.NewSource(time.Now().UnixNano()))
-	array1 := make([]int, random.Intn(100))
+	array1 := make([]int, random.Intn(100-10)+10)
 	for i := range array1 {
 		array1[i] = random.Intn(100)
 	}
diff --git a/InsertionSort/InsertionSort_test.go b/InsertionSort/InsertionSort_test.go
@@ -9,7 +9,7 @@ import (
 
 func TestInsertionSort(t *testing.T) {
 	random := rand.New(rand.NewSource(time.Now().UnixNano()))
-	array1 := make([]int, random.Intn(100))
+	array1 := make([]int, random.Intn(100-10)+10)
 	for i := range array1 {
 		array1[i] = random.Intn(100)
 	}
diff --git a/InterpolationSearch/InterpolationSearch_test.go b/InterpolationSearch/InterpolationSearch_test.go
@@ -18,7 +18,7 @@ func SortArray(array []int) {
 
 func TestInterpolationSearch(t *testing.T) {
 	random := rand.New(rand.NewSource(time.Now().UnixNano()))
-	array := make([]int, random.Intn(100))
+	array := make([]int, random.Intn(100-10)+10)
 	for i := range array {
 		array[i] = random.Intn(100)
 	}
diff --git a/JumpSearch/JumpSearch_test.go b/JumpSearch/JumpSearch_test.go
@@ -18,7 +18,7 @@ func SortArray(array []int) {
 
 func TestJumpSearch(t *testing.T) {
 	random := rand.New(rand.NewSource(time.Now().UnixNano()))
-	array := make([]int, random.Intn(100))
+	array := make([]int, random.Intn(100-10)+10)
 	for i := range array {
 		array[i] = random.Intn(100)
 	}
diff --git a/LinearSearch/LinearSearch_test.go b/LinearSearch/LinearSearch_test.go
@@ -18,7 +18,7 @@ func SortArray(array []int) {
 
 func TestLinearSearch(t *testing.T) {
 	random := rand.New(rand.NewSource(time.Now().UnixNano()))
-	array := make([]int, random.Intn(100))
+	array := make([]int, random.Intn(100-10)+10)
 	for i := range array {
 		array[i] = random.Intn(100)
 	}
diff --git a/SelectionSort/SelectionSort_test.go b/SelectionSort/SelectionSort_test.go
@@ -9,7 +9,7 @@ import (
 
 func TestSelectionSort(t *testing.T) {
 	random := rand.New(rand.NewSource(time.Now().UnixNano()))
-	array1 := make([]int, random.Intn(100))
+	array1 := make([]int, random.Intn(100-10)+10)
 	for i := range array1 {
 		array1[i] = random.Intn(100)
 	}
diff --git a/TernarySearch/TernarySearch_test.go b/TernarySearch/TernarySearch_test.go
@@ -18,7 +18,7 @@ func SortArray(array []int) {
 
 func TestTernarySearch(t *testing.T) {
 	random := rand.New(rand.NewSource(time.Now().UnixNano()))
-	array := make([]int, random.Intn(100))
+	array := make([]int, random.Intn(100-10)+10)
 	for i := range array {
 		array[i] = random.Intn(100)
 	}

Original file line number	Diff line number	Diff line change
`@@ -18,7 +18,7 @@ func SortArray(array []int) {`
`18`	`18`
`19`	`19`	`func TestBinarySearch(t *testing.T) {`
`20`	`20`	`random := rand.New(rand.NewSource(time.Now().UnixNano()))`
`21`		`- array := make([]int, random.Intn(100))`
	`21`	`+ array := make([]int, random.Intn(100-10)+10)`
`22`	`22`	`for i := range array {`
`23`	`23`	`array[i] = random.Intn(100)`
`24`	`24`	`}`
Original file line number	Diff line number	Diff line change
`@@ -9,7 +9,7 @@ import (`
`9`	`9`
`10`	`10`	`func TestBubbleSort(t *testing.T) {`
`11`	`11`	`random := rand.New(rand.NewSource(time.Now().UnixNano()))`
`12`		`- array1 := make([]int, random.Intn(100))`
	`12`	`+ array1 := make([]int, random.Intn(100-10)+10)`
`13`	`13`	`for i := range array1 {`
`14`	`14`	`array1[i] = random.Intn(100)`
`15`	`15`	`}`