الترتيب بالدمج والترتيب السريع

def merge(left, right):    result = []    i = j = 0    while i < len(left) and j < len(right):        if left[i] <= right[j]:            result.append(left[i]); i += 1        else:            result.append(right[j]); j += 1    result.extend(left[i:])     # ما بقي من اليسرى    result.extend(right[j:])    # ما بقي من اليمنى    return result print(merge([3, 27, 38, 43], [9, 10, 15, 82]))

def merge(left, right):    result = []    i = j = 0    while i < len(left) and j < len(right):        if left[i] <= right[j]:            result.append(left[i]); i += 1        else:            result.append(right[j]); j += 1    return result + left[i:] + right[j:] def merge_sort(a):    if len(a) <= 1:              # حالة التوقف        return a    mid = len(a) // 2    left = merge_sort(a[:mid])   # فرّق وسُد    right = merge_sort(a[mid:])    return merge(left, right)    # اجمع print(merge_sort([38, 27, 43, 3, 9, 82, 10, 15]))

def quick_sort(a):    if len(a) <= 1:        return a    pivot = a[-1]    smaller = [x for x in a[:-1] if x < pivot]    larger  = [x for x in a[:-1] if x >= pivot]    return quick_sort(smaller) + [pivot] + quick_sort(larger) print(quick_sort([38, 27, 43, 3, 9, 82, 10, 15]))

import randomrandom.seed(1) comps = 0def quick(a):    global comps    if len(a) <= 1:        return a    p = a[-1]    comps += len(a) - 1    return quick([x for x in a[:-1] if x < p]) + [p] + quick([x for x in a[:-1] if x >= p]) data = random.sample(range(10000), 500)quick(data);          print("عشوائية:", comps)comps = 0quick(sorted(data));  print("مرتبة:  ", comps)