Data-Structures-and-Algorithms
Data-Structures-and-Algorithms copied to clipboard
ua-nick
Data Structures and Algorithms implementation in Go
# Data Structures and Algorithms [](https://goreportcard.com/report/github.com/floyernick/Data-Structures-and-Algorithms) [](https://travis-ci.org/floyernick/Data-Structures-and-Algorithms) [](https://github.com/floyernick/Data-Structures-and-Algorithms/blob/master/LICENSE) Clean and simple implementation in Go ## Implementation There are several data structures and algorithms implemented in this project....
#18 It Make MergeSort faster than before and I Commit a pull request. ———————————————————————————————————— Benchmark_MergeSort_new Benchmark_MergeSort_new-12 10 101394033 ns/op 209956300 B/op 1000041 allocs/op Benchmark_MergeSort_new-12 10 103156080 ns/op 209956320 B/op 1000041...
The GetLast() function traverses through the entire LL to get to the last pointer, when there's already a tail node. The fix gets rid of the traversal and returns the...
Why do you add 1 to the `boundValue` here https://github.com/floyernick/Data-Structures-and-Algorithms/blob/master/ExponentialSearch/ExponentialSearch.go#L11 in the exponential search algorithm? After trying a test case where I search for an element that is not in...
the block as below ```go current := list.head for current.next != nil { if current.next.data == i { if current.next.next != nil { current.next.next.prev = current } current.next = current.next.next...
The InsertFirst() method is missing an empty list check. I copied the check from InsertLast() and made the needed changes. This fix is the following 5 lines of code: ```...
