Home > Technical Interview Preparation > How and What to Prepare > Understanding Big O Notation and Algorithmic Complexity Show previous contentTry this exercise. Click the correct answer from the options.Select the best time complexity from following options.Click the option that best answers the question.O(n^2) O(log(n)) O(n log(n)) O(n) Show following content