Fix typos in function and variable names (TheAlgorithms#632)

Author: yan-aint-nickname

README.md

@@ -324,7 +324,7 @@ Read our [Contribution Guidelines](CONTRIBUTING.md) before you contribute.
 ---
 ##### Functions:
 
-1. [`GeneticString`](./strings/genetic/genetic.go#L71):  GeneticString generates PopultaionItem based on the imputed target string, and a set of possible runes to build a string with. In order to optimise string generation additional configurations can be provided with Conf instance. Empty instance of Conf (&Conf{}) can be provided, then default values would be set. Link to the same algorithm implemented in python: https://github.com/TheAlgorithms/Python/blob/master/genetic_algorithm/basic_string.py
+1. [`GeneticString`](./strings/genetic/genetic.go#L71):  GeneticString generates PopulationItem based on the imputed target string, and a set of possible runes to build a string with. In order to optimise string generation additional configurations can be provided with Conf instance. Empty instance of Conf (&Conf{}) can be provided, then default values would be set. Link to the same algorithm implemented in python: https://github.com/TheAlgorithms/Python/blob/master/genetic_algorithm/basic_string.py
 
 ---
 ##### Types

STYLE.md

@@ -145,7 +145,7 @@ Add the `_test` suffix to your package name to implement black-box testing for y
 ### Symbol Naming
 
 Go symbols should be named in the `camelCase` or `PascalCase`, depending of whether the symbol
-is exported or not. The case when using acronymns in names should be consistent. Use `json` or
+is exported or not. The case when using acronyms in names should be consistent. Use `json` or
 `JSON` instead of `Json`.
 
 For exported symbols, use the package name to your advantage to write concise symbol names. For

dynamic/longestincreasingsubsequencegreedy.go

@@ -7,20 +7,20 @@ package dynamic
 // Auxiliary Space: O(n), where n is the length of the array(slice).
 // Reference: https://www.geeksforgeeks.org/construction-of-longest-monotonically-increasing-subsequence-n-log-n/
 func LongestIncreasingSubsequenceGreedy(nums []int) int {
-	longestIncreasingSubsequnce := make([]int, 0)
+	longestIncreasingSubsequence := make([]int, 0)
 
 	for _, num := range nums {
-		// find the leftmost index in longestIncreasingSubsequnce with value >= num
-		leftmostIndex := lowerBound(longestIncreasingSubsequnce, num)
+		// find the leftmost index in longestIncreasingSubsequence with value >= num
+		leftmostIndex := lowerBound(longestIncreasingSubsequence, num)
 
-		if leftmostIndex == len(longestIncreasingSubsequnce) {
-			longestIncreasingSubsequnce = append(longestIncreasingSubsequnce, num)
+		if leftmostIndex == len(longestIncreasingSubsequence) {
+			longestIncreasingSubsequence = append(longestIncreasingSubsequence, num)
 		} else {
-			longestIncreasingSubsequnce[leftmostIndex] = num
+			longestIncreasingSubsequence[leftmostIndex] = num
 		}
 	}
 
-	return len(longestIncreasingSubsequnce)
+	return len(longestIncreasingSubsequence)
 }
 
 // Function to find the leftmost index in arr with value >= val, mimicking the inbuild lower_bound function in C++

math/modular/exponentiation_test.go

@@ -1,5 +1,5 @@
 // exponentiation_test.go
-// description: Test for ModularExponentation
+// description: Test for ModularExponentiation
 // author(s) [Taj](https://github.com/tjgurwara99)
 // see exponentiation.go
 

search/binary_test.go

@@ -39,7 +39,7 @@ func TestLowerBound(t *testing.T) {
 }
 
 func TestUpperBound(t *testing.T) {
-	for _, test := range uppperBoundTests {
+	for _, test := range upperBoundTests {
 		actualValue, actualError := UpperBound(test.data, test.key)
 		if actualValue != test.expected {
 			t.Errorf("test '%s' failed: input array '%v' with key '%d', expected '%d', get '%d'", test.name, test.data, test.key, test.expected, actualValue)

search/testcases.go

@@ -43,7 +43,7 @@ var lowerBoundTests = []searchTest{
 	{[]int{}, 2, -1, ErrNotFound, "Empty"},
 }
 
-var uppperBoundTests = []searchTest{
+var upperBoundTests = []searchTest{
 	//Sanity
 	{[]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, -25, 0, nil, "Sanity"},
 	{[]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, 1, 1, nil, "Sanity"},

strings/genetic/genetic.go

@@ -60,7 +60,7 @@ type Result struct {
 	Best PopulationItem
 }
 
-// GeneticString generates PopultaionItem based on the imputed target
+// GeneticString generates PopulationItem based on the imputed target
 // string, and a set of possible runes to build a string with. In order
 // to optimise string generation additional configurations can be provided
 // with Conf instance. Empty instance of Conf (&Conf{}) can be provided,

structure/trie/trie_bench_test.go

@@ -22,7 +22,7 @@ func BenchmarkTrie_Insert(b *testing.B) {
 	}
 }
 
-func BenchmarkTrie_Find_non_existant(b *testing.B) {
+func BenchmarkTrie_Find_non_existent(b *testing.B) {
 
 	insert := make([]string, 3000)
 	for i := 0; i < len(insert); i++ {
@@ -37,7 +37,7 @@ func BenchmarkTrie_Find_non_existant(b *testing.B) {
 	}
 }
 
-func BenchmarkTrie_Find_existant(b *testing.B) {
+func BenchmarkTrie_Find_existent(b *testing.B) {
 	insert := make([]string, 3000)
 	for i := 0; i < len(insert); i++ {
 		insert[i] = fmt.Sprintf("%f", rand.Float64())