diff --git a/search/median_search.cpp b/search/median_search.cpp
index 08cb676c9735251cf781d402456d77e1e84bfcac..c20bcfeaab35b65cfd64052ece590a013d0e1612 100644
--- a/search/median_search.cpp
+++ b/search/median_search.cpp
@@ -4,7 +4,7 @@
  * @cases from [here](https://brilliant.org/wiki/median-finding-algorithm/)
  *
  * @details
- * Given an array A[1,...,n] of n numbers and an index idx, where 1≤idx≤ n, 1≤idx≤ n, find the i-th smallest element of A.
+ * Given an array A[1,...,n] of n numbers and an index idx, where 1≤idx≤ n, find the i-th smallest element of A.
  * median_of_medians(A, i):
  *  #divide A into sublists of len 5
  *  sublists = [A[j:j+5] for j in range(0, len(A), 5)]