Task Tracing Merge Sort To receive full marks you must demon

Task: Tracing Merge Sort

To receive full marks, you must demonstrate your ability of explaining how the algorithm works, by means of thoroughly tracking the progress of its execution on a specific input.  Draw diagrams of the array(s) or list(s) whenever necessary to help your illustration. Messy or incomplete answers will receive 0.

You can download the source code including Sorter Class here: https://gist.github.com/c0mrade4ever/01dc3a1df924ecc213d3dcce41e9ee98

Please trace these values using a table and explain. I added System.out.println(...) commands on the source code file to make it convenient for you. Thanks in advance

Solution

Left.get(i) > right.get(j)

Here the i and J are the variables , were the values are got and stored in the varaibles. Here the condition we are checking that value in i is greater than the value in j wihivh is at right side.

left.get(i) <= right.get(j)

as like up, i and j are th variable here the value obtained in the varibale i and j are compared for the leseer than eual to of the i variable in the left to the j variable of the right.

merged list

here the mereged list is the variable that was declared as the integer were we are getting the input.

Variables I and J

these are the two variables, that we use in the loop , were the conditions are checked according to loop we made.

SortedList :

If the list is changed the list with the set of values in the list will be changed accrodingly. The sorting is done accoding to condition we provided might be sorting from right to left or left right according to the usage requirement.

Sorted left is the value are sorted in the left side

sortright is the value that are sorted from the right side.

middle is the variable is getting the value of the size of the list.

left is getting the value from the left end to the middle of the list.

right is the value they are getting from the middle varible to right end.

What is tracing the merger sort:

Generally the Divide and conquer is the rule of the merge sort.Here the data are sorted in the linear manner.

Merge sort will break the data into small data sets.The sort will starting small data sets and after sorting the list od data will be combined together.This sort is usually more efficient than linear sorts because the of the fact that it generally breaks the list into half repeatedly.Since it is mergeing the datas in the sorted manner iscalled as the merge sort.