O(n log d), deprecate `ordNub`, use `nubOrd`
Open
attention: pr-welcome
documentation
- Dominant language
- Haskell
- Stars
- 1.7k
- Forks
- 750
- Avg merge
- 4d 3h
- Merged PRs (30d)
- 28
Description
**What is wrong with the docs?**
The haddocs for `ordNub` say it is O(n log n) but the equivalent `nubOrd` function from containers says that it is O(n log d)[^1]. Which is it?
Can we deprecate or remove `ordNub` and use `nubOrd` from containers ourselves? Most of our packages depend on containers.
[^1]: The "d" here is duplicates, isn't it?
Contributor guide
Assessment
This issue has not been assessed yet.