CS173: Intro to Computer Science - Merge Sort (3 Points)

Developed by Professor Tralie and Professor Mongan.

Exercise Goals

The goals of this exercise are:
  1. To implement the merge sort algorithm
  2. To swap two variables in memory
Please fill in the while loop in the mergeSort method that performs the merging step. Below is the majority of the code for merge sort, as well as some array utilities we wrote last lab. The main method fills in a random array, prints that array, calls the mergeSort method, and then prints the result. If you've done this properly, the resulting array will come back in sorted order.
Welcome to our online modules system! Be sure to log in with your Urinus ID before you proceed. For example, Professor Tralie's ID is ctralie. If you are not an Ursinus student, that's fine! Just make something up, and you can still run everything

                    

                

                

                    

                        

                    

                    

                        

                        

                        

                    

                

            


            

            
            

    



    
This exercise [1] was developed by Prof. Tralie.




  
    
    
  1. 
      
    Developed by Prof. Chris Tralie ↩
    
    
    2.