Question: HW _ 1 1 - Sorts - Demonstrates 5 Sorting Algorithm - ( One . cpp file for each sorting algorithm ) Create a new

_11 -

Sorts

-

Demonstrates

5

Sorting Algorithm

- (

One

.

cpp file for each sorting algorithm

)

Create a new C

+ +

project and name it HW

_11_

Sorts

-

When your program executes, it will first read commands from the input file.

o See the commands in the input.txt file.

-

Each command will be executed and the output will be sent to the output file

_______________________________________________________________________________________________________

You are given

7

files.

-

Enter the code for each file and run the program.

-

Turn in the output for credit.

_______________________________________________________________________________________________________

Create the following

8

files:

1 .

Source.cpp

(

main

) -

The same Source.cpp file is used for all

5

sorts.

2 .

BubbleSort.cpp

3 .

SelectionSort.cpp

4 .

HeapSort.cpp

(5

sorts

)

5 .

MergeSort.cpp

6 .

QuickSort.cpp

7 .

input.txt

-

You can create an output text file in the project or C: drive.

-

Your program will read the input data and run accordingly.

8 .

output.txt

-

You can create an output text file in the project or C: drive.

NOTE: You don

t have to create the output file, because, when the program runs, the file will

automatically be created for you. It will be created within the project and the data will be written.

_______________________________________________________________________________________________________

Run the following program and turn in the output from the output file.

/ / = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =

/ /

File: Input.txt

/ / = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =

SelectionSort

Refresh

BubbleSort

Refresh

QuickSort

Refresh

MergeSort

Refresh

HeapSort

ReInitialize

SelectionSort

Quit

/ / = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =

/ / = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =

/ /

File: Source.cpp

-

Copy and paste this code into Source.cpp

/ / = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =

#include

using namespace std;

typedef int T;

const int SIZE

= 50

;

void print

(

ofstream &

,

int

[])

;

void initValues

(

int

[])

;

void copyValues

(

int

[],

int

[])

;

void swap

(

T & item

1,

T & item

2)

;

#include "SelectionSort.cpp

"

#include "MergeSort.cpp

"

#include "QuickSort.cpp

"

#include "BubbleSort.cpp

"

#include "HeapSort.cpp

"

int main

()

{

ifstream inFile;

ofstream outFile;

string inFileName;

string outFileName;

string outputLabel;

string command;

T values

[

SIZE

]

;

int numCommands;

T copiedValues

[

SIZE

]

;

cout

< <

"Enter the input file name:

"

;

getline

(

cin

,

inFileName

)

;

inFile.open

(

inFileName

.

_

str

())

;

cout

< <

"Enter the output file name:

"

;

getline

(

cin

,

outFileName

)

;

outFile.open

(

outFileName

.

_

str

())

;

inFile

> >

command;

initValues

(

values

)

;

copyValues

(

values

,

copiedValues

)

;

outFile

< <

"Initial values"

< <

endl;

(

outFile

,

values

)

;

numCommands

= 0

;

while

(

command

! =

"Quit"

)

{

(

command

= =

"SelectionSort"

)

{

selectionSort

(

values

,

SIZE

)

;

outFile

< <

"Results from SelectionSort:

" < <

endl;

(

outFile

,

values

)

;

outFile

< <

endl;

}

else if

(

command

= =

"BubbleSort"

)

{

bubbleSort

(

values

,

SIZE

)

;

outFile

< <

"Results from BubbleSort:

" < <

endl;

(

outFile

,

values

)

;

outFile

< <

endl;

}

else if

(

command

= =

"MergeSort"

)

{

mergeSort

(

values

, 0,

SIZE

- 1)

;

outFile

< <

"Results from MergeSort:

" < <

endl;

(

outFile

,

values

)

;

outFile

< <

endl;

}

else if

(

command

= =

"QuickSort"

)

{

quickSort

(

values

, 0,

SIZE

- 1)

;

outFile

< <

"Results from QuickSort:

" < <

endl;

(

outFile

,

values

)

;

outFile

< <

endl;

}

else if

(

command

= =

"HeapSort"

)

{

heapSort

(

values

,

SIZE

)

;

outFile

< <

"Results from HeapSort:

" < <

endl;

(

outFile

,

values

)

;

outFile

< <

endl;

}

else if

(

command

= =

"Refresh"

)

copyValues

(

copiedValues

,

values

)

;

else if

(

command

= =

"ReInitialize"

)

{

initValues

(

values

)

;

copyValues<

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

In this assignment, you will conduct a set of experiments using basic sorting algorithms. Please see the description of the assignment in the following file: a6.pdf Source files: bubbleSort.py '''...

PART ONE: Starting with the templates provided below, write a program that inputs one-character commands that instruct the program to run one of the recursive functions below. Use switch to select...

This is all written in Java. This is the Grading Rubric. Instructions: Let's pull together all your knowledge of sorting algorithms and use them in a project. Imagine you work in a store and have...

In this assignment, you will conduct a set of experiments using basic sorting algorithms. Please see the description of the assignment in the following file: a6.pdf Source files: bubbleSort.py...

Preface This lab is based on Learn By Doing 1 3 . 1 0 Exercise 1 and a famous nifty assignment on authorship detection. In this part of the lab, you will create and store an array of AuthorStats...

1. Write a class called Process which stores the ID, arrival time, and CPU burst length of a process, all are integers. You can also add data members to keep track of information in order to compute...

Uses Algs4.java from princeton. But don't know how to submit the file. Create a package called ceMerge Add class MergeSlow and class MergeComparison that includes the main method. Class MergeSlow:...

I need help with answering all of the following questions pleas let me know if you need more info the dlist file that was provided section 4 and on questions please help and answer each part thank...

please help me with this as my tutor fell through and I dont understand all sections these are the programs it gave me this is the main java above this is the grade book reader above these are the...

What are the differences between substantive law procedural law criminal law civil law common law and statutory law Provide examples of each? What U.S Constitution amendments were implemented to...

Devise a synthesis of (E)-4-nonene using one of the starting materials and any of the reagents below using the fewest steps possible. If you need fewer than the 3 steps allowed, enter "none" for...

Question 3 7 of 7 5 . Which of the following taxpayers will be allowed to recognize depreciation on their property? Carol rented pasture land with no capital improvements. Gittespie bought an active...

? _ _ _ _ _ _ _ p r o v i d e s a h i g h - l e v e l d e s c r i p t i o n o f w h a t t h e p r o j e c t w i l l a c c o m p l i s h a n d h o w i t w i l l b e d o n e .

What quantitative data analysis software is available to you through work or your study centre? Do you have (or can you obtain) a personal copy?

The terms parametric and non-parametric refer to: a. Two main groups of data types that are linked to different groups of statistical tests. b. Measures of statistical significance. c. Alternative...

A perfect positive correlation between two variables in a test of correlation would give a result of: a. 0.123 b. +1 c. 0 d. 1