Computer Scienceeee

Objective:

The objective of this programming assignment is to implement in your preferred language $($already available on Tux machines$)$ the InsertSort and QuickSort algorithms presented in the lectures to sort a list of numbers. We are interested in comparing the two algorithms. For this exploration, you will collect the execution time $T(n)$ as a function of $n$ and plot on the same graph the execution times $T(n)$ of the two algorithms. You must propose pertinent $($relevant$)$ plots to validate the theoretical time complexity of each algorithm and compare them. The theoretical time complexity is the time complexity we determine through analysis. Finally, discuss your results.

Below is the pseudocode of InsertSort is:USE THIS FILE AS THE STARTING DOCUMENT YOU WILL TURN IN$.$ DO NOT DELETE ANYTHING FROM THIS FILE: JUST INSERT EACH ANSWER RIGHT AFTER ITS QUESTION$/$PROMPT$.$IF USING HAND WRITING $($STRONGLY DISCOURAGED$),$ USE THIS FILE BY CREATING SUFFICIENT SPACE AND WRITE IN YOUR ANSWERS.FAILING TO FOLLOW TURN IN DIRECTIONS $/$GUIDELINES WILL COST A $30\%$ PENALTY.

What you need to do $($Insert in this file your answers$)$:

$(30$ points$)$ Implement the InsertSort and QuickSortalgorithms to sort an array.

submit your source code in your preferred language $($as long as it is supported on Tux machines$).$

Provide here the instructions to compile and execute your code.

Actions to complete:

ssh into a Tux machine

clear the screen on the Tux machine $($use the command clear$)$

Display the current date $($use the command date$)$

Compile your program $($InsertSort and QuickSort$)$

Execute your program showing that your algorithm sorts correctly an array with $10$ elements. We must see the original array and the sorted array. We must see this for both sorting algorithms

Take a screenshot of the Tux terminal and insert here $($below$).$ Your screenshot must be as readable as this template screenshot $($we should see the username, the date, the commands typed, and the results$)$: