[sort] Investigate the performance of hana::sort
Open
optimization
- Dominant language
- C++
- Stars
- 1.9k
- Forks
- 225
- PR merge metrics
- No merged PRs in 30d
Description
As outlined in https://github.com/edouarda/brigand/issues/118#issuecomment-189834748, `hana::sort` seems to perform best in the case of a reversed list, which is the only benchmark that we have. We should investigate this and probably change the benchmark.
Contributor guide
Research direction
Start with the discussion in brigand issue 118, comment 189834748, and inspect the existing hana::sort benchmark for reversed lists. Compare performance across relevant input orderings and update the benchmark if the current case is misleading; done means the performance behavior is investigated and the benchmark reflects the findings.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp
- Domain
- performance
- Issue type
- Refactor
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100