inpu1txt file contains 2000 number eg 1 10 200 89 298 so on 1 open input1txt for reading using s

code snips reads an integral num value numval from input which represent the number of integers

In this question, solution here is let an array, let an array of size n be split into k subarray

So in this question, we are supposed to write a function that sorts a given list that is passed

W 5 13 8 5 9 10 7 6 9 11 12 13 14 15 17 18 19 20 21 23 24 25 26 27 28 30 31 32 33 Thank you.

Question

1. Open input1.txt for reading (using, say, std::ifstream). 2. Using the count value in line one of the file, read the numbers from line 2 into either a dynamically allocated array or std::vector. 3. Write either an insertion or bubble sort algorithm and sort the data. 4. Measure the time taken to complete the sort (in milliseconds). 5. Read the file contents once again into another dynamically allocated array or vector. You're going to be sorting this fresh copy of the original file dataâ€”you don't want to inadvertently sort the already-sorted vector from step 3. 6. This time, write a quick sort or merge sort algorithm and measure how long it takes to sort the data (in milliseconds). 7. Compare the times taken for the two sort operations and output. Which algorithm was the quickest sorting this particular data set to the screen?

          1. Open input1.txt for reading (using, say, std::ifstream).
2. Using the count value in line one of the file, read the numbers from line 2 into either a dynamically allocated array or std::vector.
3. Write either an insertion or bubble sort algorithm and sort the data.
4. Measure the time taken to complete the sort (in milliseconds).
5. Read the file contents once again into another dynamically allocated array or vector. You're going to be sorting this fresh copy of the original file dataâ€”you don't want to inadvertently sort the already-sorted vector from step 3.
6. This time, write a quick sort or merge sort algorithm and measure how long it takes to sort the data (in milliseconds).
7. Compare the times taken for the two sort operations and output. Which algorithm was the quickest sorting this particular data set to the screen?

Added by Rhonda M.

Question

Please give Ace some feedback