simplesort

README

Golang + Algorithm = goAlg

Sorting Algorithms

In this section I introduce Sorting Algorithms

Simple Sort

Algorithm	Best Case	Average Case	Worst case
GnomeSort	O(n)	O(n²)	O(n²)
InsertionSort	O(n)	O(n²)	O(n²)
SelectionSort	O(n²)	O(n²)	O(n²)
SlowSort	O(n^(log(n)/2))	O(np)	O(np)
SillySort	O(n^(a log n))	O(n^(a log n))	O(n^(a log n))
LibrarySort	O(n)	O(nlog(n))	O(n²)
PatienceSort	O(n)	O(nlog(n))	O(nlog(n))

Documentation

Overview

Package of Simple Sort Algorithms

See Readme.md for more info.

Index

• func GnomeSort(arr []interface{}, comp goutils.TypeComparator, low, high int)
• func InsertionSort(arr []interface{}, comp goutils.TypeComparator, low, high int)
• func SelectionSort(arr []interface{}, comp goutils.TypeComparator, low, high int)
• func SillySort(arr []interface{}, comp goutils.TypeComparator, low, high int)
• func SlowSort(arr []interface{}, comp goutils.TypeComparator, low, high int)

Functions

func GnomeSort

func GnomeSort(arr []interface{}, comp goutils.TypeComparator, low, high int)

Gnome Sort or Stupid Sort

func InsertionSort

func InsertionSort(arr []interface{}, comp goutils.TypeComparator, low, high int)

Insertion Sort

func SelectionSort

func SelectionSort(arr []interface{}, comp goutils.TypeComparator, low, high int)

Selection Sort

func SillySort

func SillySort(arr []interface{}, comp goutils.TypeComparator, low, high int)

Silly Sort

func SlowSort

func SlowSort(arr []interface{}, comp goutils.TypeComparator, low, high int)

Slow Sort or Parody Sort