title: What is the time complexity of the following function, that uses buit-in sorted function?
body: <p>I am preperaing for a job interview and was wondering what is the time complexity of <strong>find_missing</strong> function in the following code I wrote, that finds the missing value in an unsorted list of values between 1 and 99. I am rather new to complexity theory and not sure how to properly count it, when using the built-in <strong>sorted</strong> function.</p>
  <pre><code>def find_missing(num_array):
      num_array = sorted(num_array)
      print(num_array)
      for k in range(len(num_array)-1):
          if num_array[k] == num_array[k+1] - 1:
              continue
          else:
              return num_array[k] + 1
  </code></pre>