# list-shuffle

[![GitHub CI](https://github.com/awkward-squad/list-shuffle/workflows/Haskell-CI/badge.svg)](https://github.com/awkward-squad/list-shuffle/actions)
[![Hackage](https://img.shields.io/hackage/v/list-shuffle.svg)](https://hackage.haskell.org/package/list-shuffle)
[![Stackage LTS](https://stackage.org/package/list-shuffle/badge/lts)](https://www.stackage.org/lts/package/list-shuffle)
[![Stackage Nightly](https://stackage.org/package/list-shuffle/badge/nightly)](https://www.stackage.org/nightly/package/list-shuffle)
[![Dependencies](https://img.shields.io/hackage-deps/v/list-shuffle)](https://packdeps.haskellers.com/reverse/list-shuffle)

List shuffling and sampling with optimal asymptotic time and space complexity using the imperative Fisher–Yates algorithm.