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

merge sort tips

Javasper answered on July 6, 2022 Popularity 3/10 Helpfulness 2/10

answer merge sort tips

related manual merge sort

merge sort tips

Comment

for the merge() part
we have three "pointers"(where in the array are we):
the left which is where the left array starts: the leftmost position. This can for example be 0. The left array ends at mid-1
the mid which is where the right array starts (the left array just ended).
the temp array's position: this moves 1 up regardless of whether the left or right element is larger/smaller of course.
So until one of the array(left or right) runs out, we compare the left_array[left] to right_array[mid]. 
Which put the bigger (or smaller depending on whether ascending or descending) element into the temp_array. 
We then move both the left/right (whichever picked) up one position as well as the temp_array's up one position. 
When we run out in either left/right, we simply take the other array's stuff and add them all to the temp array. 
And there we have it, a sorted array. 
This array will later due to recursion act as the left/right of another merge until the whole list is sorted.

Popularity 3/10 Helpfulness 2/10 Language whatever

Source: Grepper

Tags: merge whatever

Link to this answer
Share Copy Link

Contributed on Jul 26 2022

Javasper

0 Answers Avg Quality 2/10

Closely Related Answers

manual merge sort

Comment

# Python program for implementation of MergeSort
def mergeSort(arr):
    if len(arr) > 1:
 
         # Finding the mid of the array
        mid = len(arr)//2
 
        # Dividing the array elements
        L = arr[:mid]
 
        # into 2 halves
        R = arr[mid:]
 
        # Sorting the first half
        mergeSort(L)
 
        # Sorting the second half
        mergeSort(R)
 
        i = j = k = 0
 
        # Copy data to temp arrays L[] and R[]
        while i < len(L) and j < len(R):
            if L[i] < R[j]:
                arr[k] = L[i]
                i += 1
            else:
                arr[k] = R[j]
                j += 1
            k += 1
 
        # Checking if any element was left
        while i < len(L):
            arr[k] = L[i]
            i += 1
            k += 1
 
        while j < len(R):
            arr[k] = R[j]
            j += 1
            k += 1
 
# Code to print the list
 
 
def printList(arr):
    for i in range(len(arr)):
        print(arr[i], end=" ")
    print()
 
 
# Driver Code
if __name__ == '__main__':
    arr = [12, 11, 13, 5, 6, 7]
    print("Given array is", end="\n")
    printList(arr)
    mergeSort(arr)
    print("Sorted array is: ", end="\n")
    printList(arr)
 
# This code is contributed by Mayank Khanna

Popularity 10/10 Helpfulness 1/10 Language python

Source: www.geeksforgeeks.org

Tags: manual ma

Link to this answer
Share Copy Link

Contributed on Jul 06 2022

Jae Clayton

0 Answers Avg Quality 2/10

merge sort tips

Contents

More Related Answers

merge sort tips

Closely Related Answers

manual merge sort

Grepper

Documentation

Social

Legal

Contact

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