Introduction

problem understanding The statement "Time complexity of this algorithm is at least O(N2)" is meaningless. (It says: "Time complexity of this algorithm is at least at most roughly quadratic." but big-oh gives only the upper bound on the algorithm.