Marge Sort
Marge Sort
Marge Sort
import java.util.Scanner;
/* Java program for Merge Sort */
class merge
{
// Merges two subarrays of arr[].
// First subarray is arr[l..m]
// Second subarray is arr[m+1..r]
void merge(int arr[], int l, int m, int r)
{
// Find sizes of two subarrays to be merged
int n1 = m - l + 1;
int n2 = r - m;
int no=1;
while (i < n1 && j < n2)
{
System.out.println("Iterasi ke "+no);
int bil1=L[i];
int bil2=R[j];
Ket(bil1, bil2, arr, "banding");
if (L[i] <= R[j])
{
arr[k] = L[i];
i++;
}
else
{
arr[k] = R[j];
j++;
}
no++;
k++;
}
int no=1;
while (i < n1 && j < n2)
{
System.out.println("Iterasi ke "+no);
int bil1=L[i];
int bil2=R[j];
Ket(bil1, bil2, arr, "banding");
if (L[i] > R[j])
{
arr[k] = L[i];
i++;
Ket(bil1, bil2, arr, "tetap");
}
else
{
arr[k] = R[j];
j++;
}
k++;
no++;
}
System.out.print(" -- > tukarkan " + bil1 + " dengan " + bil2 + "\n");
System.out.println("");
}
if (op == "tetap") {
// Driver method
public static void main(String args[])
{
int n, res,i;
Scanner s = new Scanner(System.in);
System.out.print("masukan jumlah data awal:");
n = s.nextInt();
int arr[] =new int[n];
System.out.println("data masuk "+n+" ");
for( i=0; i < n; i++)
{
arr[i] = s.nextInt();
}
System.out.println("Given Array");
printArray(arr);
ob.sort2(arr, 0, arr.length-1);
printArray(arr);
}
}
/* This code is contributed by Rajat Mishra */