merge sort works

2 files changed, 14 insertions, 8 deletions

diff --git a/ds/arraylist.go b/ds/arraylist.go
index c2ada86..7bc002a 100644
--- a/ds/arraylist.go
+++ b/ds/arraylist.go
@@ -35,3 +35,9 @@ func (a ArrayList) Sorted() bool {
 	}
 	return true
 }
+
+func (a ArrayList) SwapPos(i, j int) {
+	tmp := a[i]
+	a[i] = a[j]
+	a[j] = tmp
+}
diff --git a/ds/integer.go b/ds/integer.go
index bd7dbe2..4abb349 100644
--- a/ds/integer.go
+++ b/ds/integer.go
@@ -6,7 +6,7 @@ import (
 )
 
 type Integer struct {
-	val int
+	Val int
 }
 
 func RandomIntegers(length, max int) ArrayList {
@@ -36,29 +36,29 @@ func ReverseSortedIntegers(length int) ArrayList {
 }
 
 func (i Integer) String() string {
-	return fmt.Sprintf("%d", i.val)
+	return fmt.Sprintf("%d", i.Val)
 }
 
 func (i Integer) Int() int {
-	return i.val
+	return i.Val
 }
 
 func (i Integer) Equal(j Elem) bool {
-	return i.val == j.Int()
+	return i.Val == j.Int()
 }
 
 func (i Integer) Lower(j Elem) bool {
-	return i.val < j.Int()
+	return i.Val < j.Int()
 }
 
 func (i Integer) LowerEqual(j Elem) bool {
-	return i.val <= j.Int()
+	return i.Val <= j.Int()
 }
 
 func (i Integer) Higher(j Elem) bool {
-	return i.val > j.Int()
+	return i.Val > j.Int()
 }
 
 func (i Integer) HigherEqual(j Elem) bool {
-	return i.val >= j.Int()
+	return i.Val >= j.Int()
 }