未验证 提交 a1242904 编写于 作者: S Sushil Kumar 提交者: GitHub

repeated constraints removed.

上级 37b25269
......@@ -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)]
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册