aboutsummaryrefslogtreecommitdiffstatshomepage
path: root/README.md
diff options
context:
space:
mode:
Diffstat (limited to 'README.md')
-rw-r--r--README.md3
1 files changed, 2 insertions, 1 deletions
diff --git a/README.md b/README.md
index 406e6c1..2be13bb 100644
--- a/README.md
+++ b/README.md
@@ -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: