OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

repeated constraints removed.

Browse Source
This commit is contained in:
Sushil Kumar 2020-08-23 00:37:46 +05:30 committed by GitHub
parent 37b252697d
commit a1242904e1
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
search/median_search.cpp
View File

@ -4,7 +4,7 @@
* @cases from [here](https://brilliant.org/wiki/median-finding-algorithm/) * @cases from [here](https://brilliant.org/wiki/median-finding-algorithm/)
* *
* @details * @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): * median_of_medians(A, i):
* #divide A into sublists of len 5 * #divide A into sublists of len 5
* sublists = [A[j:j+5] for j in range(0, len(A), 5)] * sublists = [A[j:j+5] for j in range(0, len(A), 5)]