Could someone explain me in details why the complexity of this algorithm is big 0 of (log m )^2 *log n ? You will see below the screenshot of the algorithm in pseudocode . e
