Data.Tensort.Robustsort

This module provides variations of the Robustsort algorithm using the Sortable type

Documentation

robustsortP :: Sortable -> Sortable

Takes a Sortable and returns a sorted Sortable using a Basic Mundane Robustsort algorithm with a Permutationsort adjudicator

Examples

>>> robustsortP (SortBit [16, 23, 4, 8, 15, 42])
SortBit [4,8,15,16,23,42]

robustsortB :: Sortable -> Sortable

Takes a Sortable and returns a sorted Sortable using a Basic Mundane Robustsort algorithm with a Bogosort adjudicator

Examples

>>> robustsortB (SortBit [16, 23, 4, 8, 15, 42])
SortBit [4,8,15,16,23,42]

robustsortM :: Sortable -> Sortable

Takes a Sortable and returns a sorted Sortable using a Basic Magic Robustsort algorithm

Examples

>>> robustsortM (SortBit [16, 23, 4, 8, 15, 42])
SortBit [4,8,15,16,23,42]

robustsortRCustom :: SortAlg -> Sortable -> Sortable

Used for making recursive Robustsort algorithms

robustsortRP :: Sortable -> Sortable

Takes a Sortable and returns a sorted Sortable using a Recursive Mundane Robustsort algorithm with a Permutationsort adjudicator

Examples

>>> robustsortRP (SortBit [16, 23, 4, 8, 15, 42])
SortBit [4,8,15,16,23,42]

robustsortRB :: Sortable -> Sortable

Takes a Sortable and returns a sorted Sortable using a Recursive Mundane Robustsort algorithm with a Bogosort adjudicator

Examples

>>> robustsortRB (SortBit [16, 23, 4, 8, 15, 42])
SortBit [4,8,15,16,23,42]

robustsortRM :: Sortable -> Sortable

Takes a Sortable and returns a sorted Sortable using a Recursive Magic Robustsort algorithm

Examples

>>> robustsortRM (SortBit [16, 23, 4, 8, 15, 42])
SortBit [4,8,15,16,23,42]