Implement Counting Sort in C

[sobhanbera]

Algorithm/Data Structure: Counting Sort Programming Language: C Difficulty: ⭐️⭐️⭐️

Issue Details

Description

Counting Sort is a linear time sorting algorithm that is particularly efficient when the range of input values is small compared to the number of elements to be sorted. It works by counting the frequency of each distinct element in the input data and using that information to place elements in their correct sorted positions.

Additional Information

If you are new to Counting Sort or need guidance on implementing it in C, feel free to ask questions or seek help in the comments. This is a great opportunity for contributors to gain experience in sorting algorithms and algorithmic optimizations in C.

Note: Before starting to work on this issue, please comment below to express your interest and let us know if you have any questions or need clarification on the task.

[tony-nyagah]

I can implement this. Could you assign it to me? Thanks.

[sobhanbera]

Hey @tony-nyagah, Assigned the issue to you. You can now start working on this!

[tony-nyagah]

I submitted a PR with the code. Could you check and approve if it's okay? Thanks.

[Jatingupta9120]

Assign this issue to me