Commit 7993f81

authored

Readme updated with Radix sort

1 parent 9f7a533 commit 7993f81Copy full SHA for 7993f81

File tree

-0

lines changed

-0

lines changed

Lines changed: 8 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -75,6 +75,14 @@ __Properties__`
`75`	`75`	`* Best case performance O(n log n)`
`76`	`76`	`* Average case performance depends on gap sequence`
`77`	`77`
	`78`	`+####Radix Sorting`
	`79`	+From [Wikipedia](https://en.wikipedia.org/wiki/Radix_sort): radix sort is a non-comparative integer sorting algorithm that sorts data with integer keys by grouping keys by the individual digits which share the same significant position and value. A positional notation is required, but because integers can represent strings of characters (e.g., names or dates) and specially formatted floating point numbers, radix sort is not limited to integers. Radix sort dates back as far as 1887 to the work of Herman Hollerith on tabulating machines.
	`80`	`+`
	`81`	`+__Properties__`
	`82`	`+* Worst case performance O(wn)`
	`83`	`+* Best case performance O(w + N)`
	`84`	`+* Average case performance depends on gap sequence`
	`85`	`+`
`78`	`86`	`###### View the algorithm in [action](https://www.toptal.com/developers/sorting-algorithms/shell-sort)`
`79`	`87`
`80`	`88`	`### Time-Compexity Graphs`

Comments

(0)