Merge sort shine divide-and-conquer, stable wanda ke gudana a cikin guaranteed O(n log n) lokaci. Ya rarrabe jerin gida a rabin, ya yi sada kowane rabin muni-muni, sannan ya hada jera biyu da aka sada.
Element ɗaya a yanzu ya sada a yanzu (tushen lamari). Haɗa-haɗa jera biyu da aka sada shi ne layin layi, kuma mun yi log n matakin haɗa-haɗa.
def merge_sort(arr):
if len(arr) <= 1:
return arr
mid = len(arr) // 2
left = merge_sort(arr[:mid]) # sort left half
right = merge_sort(arr[mid:]) # sort right half
return merge(left, right)
def merge(a, b):
result, i, j = [], 0, 0
while i < len(a) and j < len(b):
if a[i] <= b[j]: # <= keeps it stable
result.append(a[i]); i += 1
else:
result.append(b[j]); j += 1
result.extend(a[i:]); result.extend(b[j:])
return result
merge_sort([5, 2, 4, 1, 3]) # -> [1, 2, 3, 4, 5]
Wa inganta lokacin da kuke buƙatar stability ko guaranteed O(n log n), kuma don linked lists da external sorting na manyan fayiloli. Saruruwan O(n) karin aiki shine babbar aibinsa.
Merge sort yana tiyaita O(n log n) ko tare da sararin, sabanin O(n²) mafi munɗon yanayin quicksort.
Tadammensa yana kiyaye jujjuyan na maɓangare maɓangarori, wanda ke da mahimmanci ga iri-irin sadu.
Matakalar haɗa-haɗa shi ne abu mai sani-sani da ake iya dawowa, kuma tsarin divide-and-conquer shine samfuri da za ka dawowa amfani duk inda.