Breaking News: Grepper is joining You.com. Read the official announcement!

Merge Sort Algorithm O(n log n)

Fantastic Flatworm answered on October 8, 2023 Popularity 5/10 Helpfulness 1/10

answer Merge Sort Algorithm O(n log n)

Merge Sort Algorithm O(n log n)

Comment

def merge_sort(arr):
    if len(arr) > 1:
        mid = len(arr) // 2  # Find the middle of the list
        left_half = arr[:mid]  # Split the list into two halves
        right_half = arr[mid:]
        
        merge_sort(left_half)  # Recursively sort the left half
        merge_sort(right_half)  # Recursively sort the right half
        
        # Merge the sorted halves back together
        i = j = k = 0
        
        while i < len(left_half) and j < len(right_half):
            if left_half[i] < right_half[j]:
                arr[k] = left_half[i]
                i += 1
            else:
                arr[k] = right_half[j]
                j += 1
            k += 1
        
        # Copy the remaining elements of left_half and right_half if any
        while i < len(left_half):
            arr[k] = left_half[i]
            i += 1
            k += 1
        
        while j < len(right_half):
            arr[k] = right_half[j]
            j += 1
            k += 1

my_list = [64, 34, 25, 12, 22, 11, 90]
merge_sort(my_list)
print("Sorted list:", my_list)

Popularity 5/10 Helpfulness 1/10 Language python

Source: chat.openai.com

Tags: algorithm merge python

Link to this answer
Share Copy Link

Contributed on Oct 08 2023

Fantastic Flatworm

0 Answers Avg Quality 2/10

Merge Sort Algorithm O(n log n)

Contents

More Related Answers

Merge Sort Algorithm O(n log n)

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.