deletions | additions       diff --git a/CST_Monopolar_Algorithm_d_leftarrow__.md b/CST_Monopolar_Algorithm_d_leftarrow__.md  index 73ac8f2..81bfaa7 100644  --- a/CST_Monopolar_Algorithm_d_leftarrow__.md  +++ b/CST_Monopolar_Algorithm_d_leftarrow__.md 
...
* \(d\leftarrow \infty; u\leftarrow\) None  * For all `p` in `P`: O(n)  * Find the two points `i,j` furthest from `p`: \(O(n)\)  * If \(|pi| \(|p,i|  + |pj|\) |p,j|\)  < \(d \): \(O(1)\) * d \(\leftarrow |pi| |p,i|  + |pj|\) |p,j|\)  * u \(\leftarrow p\)  * Return u.