Home > Technical Interview Preparation > How and What to Prepare > Understanding Big O Notation and Algorithmic Complexity Show previous contentLet's test your knowledge. Fill in the missing part by typing it in.Sorting an integer array of consecutive elements is an example of ___ case time complexity.Write the missing line below.SubmitReveal answer Show following content