Python сортировка методом слияния
def merge_sort(arr): if len(arr) <= 1: return arr mid = len(arr) // 2 left_arr = arr[:mid] right_arr = arr[mid:] left_arr = merge_sort(left_arr) right_arr = merge_sort(right_arr) return merge(left_arr, right_arr) def merge(left_arr, right_arr): result = [] i = 0 j = 0 while i < len(left_arr) and j < len(right_arr): if left_arr[i] < right_arr[j]: result.append(left_arr[i]) i += 1 else: result.append(right_arr[j]) j += 1 result += left_arr[i:] result += right_arr[j:] return result arr = [64, 34, 25, 12, 22, 11, 90] print("Исходный массив:", arr) sorted_arr = merge_sort(arr) print("Отсортированный массив:", sorted_arr)