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

added a comment block like in #962.

Browse Source
This commit is contained in:
Sushil Kumar 2020-08-21 23:47:07 +05:30 committed by GitHub
parent 406ad387db
commit b631eee388
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 11 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
search/median_search.cpp
View File

@ -1,5 +1,14 @@
// Given an array A[1,...,n] of n numbers and an index idx, idx, where 1≤idx≤ n, 1≤idx≤ n, find the i-th smallest element of A.
/**
* @file median_search.cpp
* @brief Implementation of [Median search](https://en.wikipedia.org/wiki/Median_search) algorithm.
* @cases from [here](https://brilliant.org/wiki/median-finding-algorithm/)
*
* @details
* Given an array A[1,...,n] of n numbers and an index idx, idx, where 1≤idx≤ n, 1≤idx≤ n, find the i-th smallest element of A.
* \note this algorithm implements median search for only arrays which have distinct elements
*
* @author [Sushil Kumar](https://github.com/Rp-sushil)
*/
#include <iostream>
#include <algorithm>
#include <vector>
@ -12,7 +21,6 @@ namespace search {
/**
* @namespace median_search
* @brief Functions for [Median search](https://en.wikipedia.org/wiki/Median_search) algorithm
* @cases from [here](https://brilliant.org/wiki/median-finding-algorithm/)
*/
namespace median_search {
/* Assume that all the elements of A are distinct