commit 7705977950056c7badaf28db2709c2843c25cf30
parent 8d57d4272bd4b9af4e5cf472c23440bcb2edac39
Author: LindholmLabs <william_lindholm@outlook.com>
Date: Sat, 6 Apr 2024 12:36:39 +0200
Fixed a bug.
Diffstat:
1 file changed, 2 insertions(+), 2 deletions(-)
diff --git a/dsa/merge-sort.go b/dsa/merge-sort.go
@@ -7,7 +7,7 @@ import (
)
func main() {
- v := []int{9, 8, 6, 3, 1, 0, 11, 4}
+ v := []int{9, 8, 6, 3, 1, 1, 11, 4}
printArr(v)
printArr(mergeSort(v))
}
@@ -40,7 +40,7 @@ func merge(v1 []int, v2 []int) []int {
// If both halves contain elements
for len(v1) > v1pos && len(v2) > v2pos {
- if v1[0] < v2[0] {
+ if v1[v1pos] < v2[v2pos] {
v3 = append(v3, v1[v1pos])
v1pos++
} else {