mgs/median-comparison
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Add complexity text to README

Browse Source
This commit is contained in:
karl 2020-10-20 10:43:44 +02:00
parent c8d465c289
commit 4d752627f2
1 changed files with 5 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
README.md
View File

@ -43,4 +43,8 @@ vector median of medians + quickselect (exact) : 22.3934ms
vector median of medians only (approximative) : 11.3237ms
wirth kth element : 8.5368ms
--------------------
```
```
## Complexity
The algorithms which fully sort the array (quicksort median, array quicksort, array std sort) have an average complexity of O(N logN). All 'proper' median algorithms (randomized select, vector median of medians, wirth kth element, nth element) have an average complexity of O(N). The difference is well visible in the results above.