Through the sorting algorithm test, the lab demonstrates through the differences of different forms of sorting algorithms: permutation, insertion, and merging. Through the forms of the lab, the three sorting algorithms are demonstrated through their methods of evaluation, and subsequently their efficiency.
To start, we begin the evaluation of the insertion sorting method. With this method, the algorithm creates a sorting array of which involves such going through one frame at a time. As such, this demonstrates inefficiency due to a number of arrays that form a common algorithm, as such proving to be taxing work, much like how a person is required to solve such a complex problem without a computer’s productivity.
Another sorting algorithm is the permutation method. Though this method, the function creates the possible outcomes of the input’s integration. Through which, it sets up the paradigm. After, with these, it searches through the possible solutions until the sorted solution is identified. However, this itself is also inefficient, as the requirement to sort the algorithm into the correct array requires numerous attempts, or which result in the necessary time to sort the algorithms and to locate the correct solution.
Finally, we arrive at the merge sorting algorithm, in which an algorithm is sorted through the method of dividing between the variables, which allows for the order of the elements, and subsequently an equal between the input and output. This method is the most efficient out of the three as to how it allows for the answer to be reached through sorting the array, ultimately coming to the output through the process of elimination, narrowing down the answer.
Ultimately, this shows the efficiency of merging over both insertion and permutation, as to how the former allows for the algorithm to be solved through equal input and output, whereas the other two really on more step by step processes that make them inefficient.