I have one exercise assignment in c language.  I shared the explanation of the instructor and the all information of the exercises as ptt. – Follow the instructions in the assignment. This assignment deals with different sort routines. You are expected to implement 4 simple sort routines and three advanced sort routines. You will prompt the user to select one of the simple sort routines and one of the advanced sort routines. The input is read from input file. Your output should consists of 2 selections of one simple sort routine and one advanced sort routine. The instructor should be able to select any of the four simple sort routines and any of the advanced sort routines. For quicksort option, attempt iterative version of the solution and for merge sort option attempt the recursive option. The algorithm and output for both sort routines is given in the Additional reading material. The slides consists of quicksort recursive solution and iterative merge sort solution. For this assignment, you need to give an iterative quicksort solution and a merge sort recursive solution.

This exercise assignment involves implementing different sort routines in the C language. The assignment requires you to implement four simple sort routines and three advanced sort routines. The user will be prompted to select one simple sort routine and one advanced sort routine, and the program will read input from an input file and provide the output based on the user’s selected sort routines.

The instructor has provided additional reading materials, which include the algorithm and output for both the simple and advanced sort routines. The slides specifically cover the recursive solution for quicksort and the iterative solution for merge sort. However, for this assignment, you need to provide an iterative solution for quicksort and a recursive solution for merge sort.

To clarify, the assignment requires you to implement the following sort routines:

Simple sort routines:
1. Insertion sort
2. Selection sort
3. Bubble sort
4. Shell sort

Advanced sort routines:
1. Quicksort (iterative version)
2. Merge sort (recursive version)
3. Another advanced sort routine (to be specified by the instructor)

The instructor has the option to select any of the four simple sort routines and any of the advanced sort routines. For the quicksort option, you should implement the iterative version of the solution, while for the merge sort option, you should implement the recursive version.

The input for the program will be read from an input file, and the output should consist of two selections: one simple sort routine and one advanced sort routine.

In summary, this assignment requires you to implement various sort routines in the C language. You need to provide an iterative solution for quicksort and a recursive solution for merge sort. The program will prompt the user to select one simple sort routine and one advanced sort routine, and the input will be read from an input file. The instructor has the freedom to choose any of the provided sort routines.