diff options
| author | Egor Tensin <Egor.Tensin@gmail.com> | 2016-04-17 01:15:21 +0300 |
|---|---|---|
| committer | Egor Tensin <Egor.Tensin@gmail.com> | 2016-04-17 01:15:21 +0300 |
| commit | 6f3dc8b0b55120b0022cc497f519bb5c120dc557 (patch) | |
| tree | c083982d2de7ef0cce81e2b946e9b271587841a3 /README.md | |
| parent | README update (diff) | |
| download | sorting-algorithms-6f3dc8b0b55120b0022cc497f519bb5c120dc557.tar.gz sorting-algorithms-6f3dc8b0b55120b0022cc497f519bb5c120dc557.zip | |
implement median value calculation
Diffstat (limited to 'README.md')
| -rw-r--r-- | README.md | 3 |
1 files changed, 2 insertions, 1 deletions
@@ -15,7 +15,8 @@ Currently the following algorithms are implemented: * insertion sort (`insertion_sort.py`), * merge sort (`merge_sort.py`), * quicksort (`quicksort.py`), -* selection sort (`selection_sort.py`). +* selection sort (`selection_sort.py`), +* calculating the median of a list (`median.py`). You can test each of the algorithms above by passing a sequence of integer numbers to the corresponding script: |