open-source-contribution-for-beginners
open-source-contribution-for-beginners copied to clipboard
Published
20 hours ago •
cyberbuddy-io
cyberbuddy-io
i have to add the comparision of differrent sorting algorithms .
| Algorithm | Time Complexity | Space Complexity | Stability | Best Case | Average Case | Worst Case |
|---|---|---|---|---|---|---|
| Bubble Sort | O(n) | O(1) | Yes | O(n) | O(n^2) | O(n^2) |
| Selection Sort | O(n^2) | O(1) | No | O(n^2) | O(n^2) | O(n^2) |
| Insertion Sort | O(n) - O(n^2) | O(1) | Yes | O(n) | O(n^2) | O(n^2) |
| Merge Sort | O(n log n) | O(n) | Yes | O(n log n) | O(n log n) | O(n log n) |
| Quick Sort | O(n log n) - O(n^2) | O(log n) | No | O(n log n) | O(n log n) | O(n^2) |
| Heap Sort | O(n log n) | O(1) | No | O(n log n) | O(n log n) | O(n log n) |
| Counting Sort | O(n + k) | O(n + k) | Yes | O(n + k) | O(n + k) | O(n + k) |
| Radix Sort | O(d * (n + k)) | O(n + k) | Yes | O(d * n) | O(d * n) | O(d * n) |
| Bucket Sort | O(n^2) (average) | O(n + k) | Yes | O(n^2) | O(n^2) | O(n^2) |
Hey Contributor! You can start working on the issue. Good luck! Please comment "/assign" to get this issue assigned to you.
![github-actions[bot] avatar](https://avatars.githubusercontent.com/in/15368?v=4 "Published by a pub.dev verified publisher"){kind=small}
This issue has been assigned to @AishwaryJain07! It will become unassigned if it isn't closed within 7 days. A maintainer can also add the pinned label to prevent it from being unassigned.
@AishwaryJain07, this issue hasn't had any activity in 4 days. It will become unassigned in 3 days to make room for someone else to contribute.