以下Python代码实现的排序算法的时间复杂度是？（    ）

def func_sort(arr):

      for i in range(1, len(arr)):

            key = arr[i]

            j = i-1

            while j >= 0 and key < arr[j]:

                  arr[j+1] = arr[j]

                  j -= 1

            arr[j+1] = key