Concepts of Computer Science

Sorting is a technique to order the data in a way such that data will remain in lowest to highest form. There are various techniques involved in sorting data.I have added the implementation of few important sorting techniques. Please click on link to read in detail:- Bubble Sort Selection Sort Insertion Sort Merge Sort

Merge Sort  is a technique of sorting data with below steps:- 1) Divide the data recursively until it can not  divide more. 2)  Compare the data and sort it. 3) Merge the data again . /* * Merge Sort is based on the concept below points:- * 1) Divide array until it can not be divide. * 2) Merge it again in sorted pattern * * */ public class MergeSort { public static int [] mergeSort ( int arr []) { //check for size if it is one then already sorted int size = arr . length ; if ( size == 1 ) { return arr ; } //find middle (divide an array into two half) int mid = size / 2 ; //first half int [] fhalf = new int [ mid ]; //second half int [] shalf = new int [ size - mid ]; // Copy first half of the array for ( int i = 0 ; i < mid ; i ++) { fhalf [ i ] = arr [ i ]; } // Copy second half of the array for ( int i = mid ; i < si