Using the techniques learned in your C/C++ language classes to create a complete C++ program emulating a sorting machine. The machine is capable of the following: ⚫Sort all the integers in a given text file named file1.txt, and output the sorted result ⚫Sort all the strings in a given text file named file2.txt, and output the sorted result ⚫Supporting two different sorting orders: increasing, decreasing ⚫Supporting different sorting algorithms (at least, two): any that you can implement ⚫For each sorting procedure, print out the execution time (time spent on sorting) User interface can be command line based, by using keyboard only ⚫You can create test files by yourself, as input files to the program ⚫The interface must be professional and fully intuitive to the user. The program may use a class to define and implement each of the sorting methods as member functions, you can define multiple inherited classes to implement different sorting algorithms. you may also use all the major structures, including: ⚫ Selection statements (if, if-else, switch), the appropriate one(s) of course ⚫ Loops (while, for, do-while), the appropriate one(s) of course ⚫Functions ⚫Arrays ⚫Class encapsulation and inheritance
Using the techniques learned in your C/C++ language classes to create a complete C++ program emulating a sorting machine. The machine is capable of the following:
⚫Sort all the integers in a given text file named file1.txt, and output the sorted result
⚫Sort all the strings in a given text file named file2.txt, and output the sorted result
⚫Supporting two different sorting orders: increasing, decreasing
⚫Supporting different sorting
⚫For each sorting procedure, print out the execution time (time spent on sorting) User interface can be command line based, by using keyboard only
⚫You can create test files by yourself, as input files to the program
⚫The interface must be professional and fully intuitive to the user.
The program may use a class to define and implement each of the sorting methods as member functions, you can define multiple inherited classes to implement different sorting algorithms.
you may also use all the major structures, including:
⚫ Selection statements (if, if-else, switch), the appropriate one(s) of course
⚫ Loops (while, for, do-while), the appropriate one(s) of course
⚫Functions
⚫Arrays
⚫Class encapsulation and inheritance
Trending now
This is a popular solution!
Step by step
Solved in 5 steps with 11 images
