boristane / boristane/arr-sorting
Implement the Hoare partition scheme for quick sort
Open
enhancement
good first issue
help wanted
- Dominant language
- JavaScript
- Stars
- 2
- Forks
- 0
- PR merge metrics
- No merged PRs in 30d
Description
The current quick sort function uses the [Lamuto partition scheme](https://en.wikipedia.org/wiki/Quicksort#Lomuto_partition_scheme). The [Hoare partition scheme](https://en.wikipedia.org/wiki/Quicksort#Hoare_partition_scheme) is more efficient and would be a good enhancement.
Contributor guide
Assessment
This issue has not been assessed yet.