sort

README

Merge sort

Merge sort algorithm implementation

Usage

import "github.com/vehsamrak/merge-sort"

unsortedList := []int{3,2,1}
sorter := &sort.MergeSorter{}
sortedList := sorter.Sort(unsortedList)

// sortedList would be: [1, 2, 3]

Tests

go test ./...

Documentation

Index

• type MergeSorter
  • func (sorter *MergeSorter) Sort(unsortedElements []int) (sortedElements []int)

Types

type MergeSorter

type MergeSorter struct {
}

MergeSorter can sort elements using "merge sort" algorithm

func (*MergeSorter) Sort

func (sorter *MergeSorter) Sort(unsortedElements []int) (sortedElements []int)

Sort uses "merge sort" algorithm to sort integers using recursion