Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.Robustsort

Description

This module provides convenience functions that wraps common Robustsort functions to sort lists of Bits without dealing with type conversion

Synopsis

Documentation

Takes a list of Bits and returns a sorted list of Bits using a Basic Mundane Robustsort algorithm with a Permutationsort adjudicator

This is a convenience function that wraps the robustsortP function

Expand

>>> robustsortP [16, 23, 4, 8, 15, 42]
[4,8,15,16,23,42]

Takes a list of Bits and returns a sorted list of Bits using a Basic Mundane Robustsort algorithm with a Bogosort adjudicator

This is a convenience function that wraps the robustsortB function

Expand

>>> robustsortB [16, 23, 4, 8, 15, 42]
[4,8,15,16,23,42]

Takes a list of Bits and returns a sorted list of Bits using a Basic Magic Robustsort algorithm

This is a convenience function that wraps the robustsortM function

Expand

>>> robustsortM [16, 23, 4, 8, 15, 42]
[4,8,15,16,23,42]

Takes a list of Bits and returns a sorted list of Bits using a Recursive Mundane Robustsort algorithm with a Permutationsort adjudicator

This is a convenience function that wraps the robustsortRP function

Expand

>>> robustsortRP [16, 23, 4, 8, 15, 42]
[4,8,15,16,23,42]

Takes a list of Bits and returns a sorted list of Bits using a Recursive Mundane Robustsort algorithm with a Bogosort adjudicator

This is a convenience function that wraps the robustsortRB function

Takes a list of Bits and returns a sorted list of Bits using a Recursive Magic Robustsort algorithm

This is a convenience function that wraps the robustsortRM function