Primary Task Response: Within the Discussion Board area, write a respond to the following questions with your thoughts, ideas, and comments. This will be the foundation for future discussions by your...

Sorting Algorithm:
A sorting refers to the operations or technique of arranging and rearranging set of array or list data in a particular format either ascending or descending order. it sorts the elements according to a comparison operator. this algorithm can be used any programming language means doesn't depend on any specific programming language. There is some sorting algorithm are as follows,
a. Selection sorting
b. Quick sorting
c. Merge sorting
d. Insertion sorting
e. Bubble sorting
f. Heap sorting
Every sorting has some quality according to requirement and also having some pros and cons while using in the scenario. As per our needs, I will use Merge sort because other sorting algorithm having some disadvantages which is not suitable or fixes according to our requirement like Bubble sort is not good for a list containing having a larger number of items, selection sort is its poor efficiency when dealing with a list of large number of items, disadvantage of Quick sort is that in case of worst-case performance is very low or similar to average performances of the insertion sort, bubble sort or selections sorts. Heap sort consume more space for...