writing code for merge sort that does not use recursive calls to any functions. Instead, it just uses loops. Any program that can be done with recursive calls to a method can also be done without any recursive calls and still be as efficient. It saves time and space by avoiding the overhead of repeated calls to methods. Read all the details carefully and follow them.

* First of all it has to be coded in Java and using NetBeans as IDE

1.Create new NetBeans project that is called MergeSort (case sensitive) and a main class with that same name will be created. Make sure when you create the project, the Create Main Class is checked in NetBeans and the package name is removed. i.e. mergesort.MergeSort should be changed to MergeSort before you click the Finish button.

2. The input for the program comes from a text file called input.txt and the output will be written to output.txt. Note that NetBeans requires that both those files be in the root directory of the project, namely the MergeSort folder and not the src folder or build folder that NetBeans creates.

3. The input.txt will contain several lines of numbers where each line will have integers separated by spaces as unsorted lists. Each line must be sorted separately by your algorithm. So the algorithm is called repeatedly (not recursively) for each line in the input.txt. Use Scanner inFile = new Scanner(new FileReader("input.txt"));.

4.The output.txt will have the same numbers sorted for each line and in the same order of lines as in the input file. Use PrintWriter outFile = new PrintWriter("output.txt");