Organize algorithms into subpackages

search/binary_search.go

@@ -1,4 +1,4 @@
-package algorithms
+package search
 
 // BinarySearch is an implementation of binary search algorithm.
 // Wikipedia: https://en.wikipedia.org/wiki/Binary_search_algorithm

search/binary_search_test.go

@@ -1,4 +1,4 @@
-package algorithms
+package search
 
 import (
 	"testing"

sort/binary_insertion_sort.go

@@ -1,27 +1,27 @@
-package algorithms
+package sort
 
 // BinaryInsertionSort is an implementation of binary insertion sort algorithm.
 // Wikipedia: https://en.wikipedia.org/wiki/Insertion_sort#Variants
 func BinaryInsertionSort(a []int) []int {
 	for i := 1; i < len(a); i++ {
 		v := a[i]
-		low := 0
+		first := 0
-		high := i
+		last := i
 
-		for low < high {
+		for first < last {
-			mid := low + (high-low)/2
+			mid := first + (last-first)/2
 			if v < a[mid] {
-				high = mid
+				last = mid
 			} else {
-				low = mid + 1
+				first = mid + 1
 			}
 		}
 
-		for j := i; j > low; j-- {
+		for j := i; j > first; j-- {
 			a[j] = a[j-1]
 		}
 
-		a[low] = v
+		a[first] = v
 	}
 
 	return a

sort/binary_insertion_sort_test.go

@@ -1,4 +1,4 @@
-package algorithms
+package sort
 
 import (
 	"testing"

sort/insertion_sort.go

@@ -1,4 +1,4 @@
-package algorithms
+package sort
 
 // InsertionSort is an implementation of insertion sort algorithm.
 // Wikipedia: https://en.wikipedia.org/wiki/Insertion_sort

sort/insertion_sort_test.go

@@ -1,4 +1,4 @@
-package algorithms
+package sort
 
 import (
 	"testing"

sort/sort_test.go

@@ -1,4 +1,4 @@
-package algorithms
+package sort
 
 import (
 	"testing"