tensort-1.0.1.2: Tunable sorting for responsive robustness and beyond
Safe HaskellSafe-Inferred
LanguageHaskell2010

Data.Tensort

Description

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

Synopsis

Documentation

tensort :: [Bit] -> [Bit] Source #

Takes a list of Bits and returns a sorted list of Bits using a Standard Logarithmic Tensort algorithm

This is a convenience function that wraps the tensortBL function

Examples

Expand
>>> tensort [16, 23, 4, 8, 15, 42]
[4,8,15,16,23,42]