ASCI-COEP / ASCI-COEP/hacktoberfest
Implement quicksort in C
Open
good first issue
hacktoberfest
- Dominant language
- Jupyter Notebook
- Stars
- 12
- Forks
- 117
- PR merge metrics
- No merged PRs in 30d
Description
Implement **quicksort** in C, placing the code in `Sorting/` directory
Contributor guide
No contributing guide indexed for this repository
Research direction
Start by inspecting the existing files in the `Sorting/` directory and the repository’s other algorithm implementations to understand naming and layout conventions. Add the quicksort implementation in C there, and consider the work complete when it correctly sorts representative input cases and matches the surrounding project’s conventions.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- c
- Domain
- backend
- Issue type
- Feature
- Difficulty
- 2/5
- Estimated time
- 1-3 hours
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 45/100