backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-09 23:53:18 +08:00
Code Issues Projects Releases Wiki Activity

Update probability/windowed_median.cpp

Browse Source 
Co-authored-by: David Leal <halfpacho@gmail.com>
This commit is contained in:
Yaniv Hollander
2021-10-03 20:49:24 -04:00
committed by GitHub
parent 6fb75901f2
commit 7ab71f24be
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
probability/windowed_median.cpp
View File

@@ -15,7 +15,7 @@
* whenever values are inserted or erased to/from BST. The root of the tree is the median! Hence, median retrieval is always O(1)
*
* Time complexity: O(logN). Space complexity: O(N). N - size of window
* @author [Yaniv Hollander] (https://github.com/YanivHollander)
* @author [Yaniv Hollander](https://github.com/YanivHollander)
*/
#include <algorithm>
#include <cassert>