Big O phase when there is `O(n), O(n) and O(n2), then the total time complexity is O(n2) Original Source Snippet-Markup Algorithm/big-o.md