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

merge sort algo

Add Answer

Innocent Iguana answered on July 9, 2020 Popularity 10/10 Helpfulness 2/10

answer merge sort algo

related Merge sort algorithm

related merge sort algorithm

merge sort algo

Comment

def mergeSort(arr): 
    if len(arr) >1: 
        mid = len(arr)//2 # Finding the mid of the array 
        L = arr[:mid] # Dividing the array elements  
        R = arr[mid:] # into 2 halves 
  
        mergeSort(L) # Sorting the first half 
        mergeSort(R) # Sorting the second half 
  
        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 to test the above 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)

Popularity 10/10 Helpfulness 2/10 Language whatever

Source: Grepper

Tags: merge whatever

Link to this answer
Share Copy Link

Contributed on Jul 09 2020

Innocent Iguana

0 Answers Avg Quality 2/10

Closely Related Answers

Merge sort algorithm

Comment

import java.util.Random;

public class MergeSort {
  public static void main(String[] args) {

    Random rand = new Random();
    int[] numbers = new int[10];

    for (int i = 0; i < numbers.length; i++) {
      numbers[i] = rand.nextInt(1000000);
    }

    System.out.println("Before:");
    printArray(numbers);

    mergeSort(numbers); 

    System.out.println("\nAfter:");
    printArray(numbers);
  }


  private static void mergeSort(int[] inputArray) {
    int inputLength = inputArray.length;
    
    if (inputLength < 2) {
      return;
    }
    
    int midIndex = inputLength / 2;
    int[] leftHalf = new int[midIndex];
    int[] rightHalf = new int[inputLength - midIndex];
    
    for (int i = 0; i < midIndex; i++) {
      leftHalf[i] = inputArray[i];
    }
    for (int i = midIndex; i < inputLength; i++) {
      rightHalf[i - midIndex] = inputArray[i];
    }
    
    mergeSort(leftHalf);
    mergeSort(rightHalf);
    
    merge(inputArray, leftHalf, rightHalf);
  }

  private static void merge (int[] inputArray, int[] leftHalf, int[] rightHalf) {
    int leftSize = leftHalf.length;
    int rightSize = rightHalf.length;
    
    int i = 0, j = 0, k = 0;
    
    while (i < leftSize && j < rightSize) {
      if (leftHalf[i] <= rightHalf[j]) {
        inputArray[k] = leftHalf[i];
        i++;
      }
      else {
        inputArray[k] = rightHalf[j];
        j++;
      }
      k++;
    }
    
    while (i < leftSize) {
      inputArray[k] = leftHalf[i];
      i++;
      k++;
    }
    
    while (j < rightSize) {
      inputArray[k] = rightHalf[j];
      j++;
      k++;
    }
    
  }

  private static void printArray(int[] numbers) {
    for (int i = 0; i < numbers.length; i++) {
      System.out.println(numbers[i]);
    }
  }
}

Popularity 10/10 Helpfulness 2/10 Language whatever

Source: Grepper

Tags: algorithm algo

Link to this answer
Share Copy Link

Contributed on Mar 12 2023

Awful Anaconda

0 Answers Avg Quality 2/10

merge sort algorithm

Comment

int i =0,j=0,k=0;
    while(i<A.size() && B.size())
    {
        if(A[i] < B[j])
        {
            C[k++] = B[j++];
        }
        else
        {
            C[k++] = A[i++];
        }
    }
    while(i<A.size()){
        C[k++] = A[i++];
    }
    while(j<B.size())
    {
        C[k++] = B[j++];
    }

Popularity 8/10 Helpfulness 1/10 Language cpp

Source: Grepper

Tags: algorithm algo

Link to this answer
Share Copy Link

Contributed on Sep 24 2023

Depressed Dugong

0 Answers Avg Quality 2/10

merge sort algo

Contents

More Related Answers

merge sort algo

Closely Related Answers

Merge sort algorithm

merge sort algorithm

Grepper

Documentation

Social

Legal

Contact

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