def merge_sort(arr):

    if len(arr) > 1:

        mid = len(arr) // 2  # Finding the middle of the array

        left_half = arr[:mid]

        right_half = arr[mid:]

        merge_sort(left_half)  # Recursive call on left

        merge_sort(right_half)  # Recursive call on right

        # Merge the sorted halves

        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

        # Checking for remaining elements

        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

# Sample input

arr = [38, 27, 43, 3, 9, 82, 10]

print("Original array:", arr)

merge_sort(arr)

print("Sorted array:", arr)