(Test_arr)
| 12 | |
| 13 | |
| 14 | def Insertion_Sort(Test_arr): |
| 15 | for i in range(1, len(Test_arr)): |
| 16 | val = Test_arr[i] |
| 17 | j = Binary_Search(Test_arr[:i], 0, len(Test_arr[:i]) - 1, val) |
| 18 | Test_arr.pop(i) |
| 19 | Test_arr.insert(j, val) |
| 20 | return Test_arr |
| 21 | |
| 22 | |
| 23 | if __name__ == "__main__": |
no test coverage detected