I Need A Person Who Know C Language

*

EXERCISE 12

PROBLEM

Implement four simple sort routines ( Bubble sort, insertion sort, shell sort, and selection sort) are discussed in the course. Implement all the advanced sort routines (Quicksort iterative, Heapsort, Merge sort recursive). Prompt user to select the sort routines to run. User will pick one among the choice sort routines one from simple sorts and one from the advanced sort options. You will implement all sort routines. All sort routines should be selectable when run by the instructor. In the output you will show user picking one simple routine and one advanced sort routine. Instructor will test all sort routines

Note: See Shell sort in resources – reading.

Read input from an input file directly as integers:

49, 17, 56, 85, 12, 97, 33, 71, 19, 62, 38, 84, 51,

29, 77, 65, 44, 99, 4, 47,67, 41, 23, 88, 73, 8, 100, 25, 91, 58, 59, 22, 15, 35, 95, 60, 20, 7, 50, 10

DELIVERABLES

Read input from a file. Lecture slides have recursive quicksort solution and iterative merge sort solution. You will solve quicksort iterative method and merge sort recursive method. Additional reading material has algorithms and output for both solutions. Write the prolog and fill up all information for this exercise as given in the sample. Submit the source code, input and the output files. The program is expected to be well commented. Place your program as soft copy on assigned shared drive for students of this course.

DUE DATES

Assignments are due on the following week after completing the chapter discussion.