Merge Sort in Java using Method and Constructor
-- Merge sort work in Divide and Conquer technique
-- Merge sort work in Divide and Conquer technique
public class MergeSort {
int[]array;
int[]tempMergeArr;
int length;
public static void main(String[] args) {
int [] inputArr={48,36,13,52,19,94,21};
MergeSort ms=new MergeSort();
ms.sort(inputArr);
for (int i:inputArr){
System.out.print(i+" ");
}
}
public void sort(int inputArr[]){
this.array=inputArr;
this.length=inputArr.length;
this.tempMergeArr=new int[length];
divideArray(0,length-1);
}
public void divideArray(int lowerIndex,int higherIndex){
if (lowerIndex<higherIndex){
int middle=lowerIndex+(higherIndex-lowerIndex)/2;
//it will sort left side of an array
divideArray(lowerIndex,middle);
//it will show right side of an array
divideArray(middle+1,higherIndex);
mergeArray(lowerIndex,middle,higherIndex);
}
}
public void mergeArray(int lowerIndex,int middle,int higherIndex){
for (int i=lowerIndex;i<=higherIndex;i++){
tempMergeArr[i]=array[i];
}
int i=lowerIndex;
int j=middle+1;
int k=lowerIndex;
while (i<=middle && j<=higherIndex){
if (tempMergeArr[i]<=tempMergeArr[j]){
array[k]=tempMergeArr[i];
i++;
}
else {
array[k]=tempMergeArr[j];
j++;
}
k++;
}
while(i<=middle){
array[k]=tempMergeArr[i];
k++;
i++;
}
}
}
Output :
Sorting and Searching Programs
Start
with your Choice
-Important Programs for
Freshers
- Palindrome Number
- Prime Number
- Swapping Number
- Leap Year
- Odd and Even Number
- Fibonacci Series
- Armstrong Number
- Factorial Number
- Print Table
Learn
Pattern Programs
- Alphabet pattern
program in java
- Star Pattern Programs in Java
- Square pattern
programs in java
- Diamond Star pattern
programs in java
- Number Pattern
Programs in java
- Diagonal pattern
program in java
Click to
learn Array Programs
- 4 ways to print
Array in Java
- 2D Array in Java
- Anonymous Array in
Java
- Single
Dimensional Array in Java
- Find Second Largest
Number in Array
- Delete an Element in
Array in Java
- Common Element in
Array in Java
- Missing Element in
Array
- Insert Element in
Array
- Reverse Array in Java
- Merge Two Array in Java
- Smallest and Largest
Elements in Array
- Find Odd and Even
Number in Array
Click
to Learn
MySQL
Learn with us | HTML | CSS | JS | Bootstrap |
JAVA | ADV JAVA | SQL | GIT
No comments:
Post a Comment