Skip to content

Update README.md #5

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: develop
Choose a base branch
from
Open

Update README.md #5

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
13 changes: 13 additions & 0 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -93,3 +93,16 @@ An inplace comparison sorting algorithm that is slow for large data sets, but it
|Best case performance |O(n^2)
|Average case performance |O(n^2)
|Space |O(1)

###Counting Sort
In this sort, we count the frequencies of distinct elements of array and store them in an auxiliary array, by mapping its value as index of auxiliary array and then place each element in its proper position in the output array .
( *Here max is the maximum value present in the list of elements )

https://en.wikipedia.org/wiki/Counting_sort|stable|
|----|---
|Worst case performance |O(n+max)
|Best case performance |O(n+max)
|Average case performance |O(n+max)
|Space |O(max) auxillary