(Test_arr, low, high, k)
| 1 | def Binary_Search(Test_arr, low, high, k): |
| 2 | if high >= low: |
| 3 | Mid = (low + high) // 2 |
| 4 | if Test_arr[Mid] < k: |
| 5 | return Binary_Search(Test_arr, Mid + 1, high, k) |
| 6 | elif Test_arr[Mid] > k: |
| 7 | return Binary_Search(Test_arr, low, Mid - 1, k) |
| 8 | else: |
| 9 | return Mid |
| 10 | else: |
| 11 | return low |
| 12 | |
| 13 | |
| 14 | def Insertion_Sort(Test_arr): |