Write the program that allows the user to sort using the Merge Sort and Quick Sort. The program should be able to read in data from a binary file (1000000numbers). The first element of the binary file will be used to tell how many elements to read in. Once all the data has been read in, the program should sort the data. The user should be able to choose which algorithm to use to sort the data. The program should print the time before and after the sort. The last part of the program should prompt the user for a lower and upper bound. These two values should then be used to decide how much and which part of the array will be display. You should test all of the sorts on each of the data files. There are a number of files (10numbers.zip, etc.) of increasing size that you can utilize for testing purposes. Continue to add a a justification of the difference between the run times of each sort when compared to those you're reported on earlier. Include the screenshots of the runtimes on both the million and 10 million element lists (Don't rerun the first four algorithms with the 10 million list). Continue noting the best, worst, and average runtims for all algorithms as well as a justification of why the new algorithms are faster or slower.
Write the program that allows the user to sort using the Merge Sort and Quick Sort. The program should be able to read in data from a binary file (1000000numbers). The first element of the binary file will be used to tell how many elements to read in. Once all the data has been read in, the program should sort the data. The user should be able to choose which algorithm to use to sort the data. The program should print the time before and after the sort. The last part of the program should prompt the user for a lower and upper bound. These two values should then be used to decide how much and which part of the array will be display. You should test all of the sorts on each of the data files. There are a number of files (10numbers.zip, etc.) of increasing size that you can utilize for testing purposes. Continue to add a a justification of the difference between the run times of each sort when compared to those you're reported on earlier. Include the screenshots of the runtimes on both the million and 10 million element lists (Don't rerun the first four algorithms with the 10 million list). Continue noting the best, worst, and average runtims for all algorithms as well as a justification of why the new algorithms are faster or slower.
Related questions
Question
Write the program that allows the user to sort using the Merge Sort and Quick Sort. The program should be able to read in data from a binary file (1000000numbers). The first element of the binary file will be used to tell how many elements to read in. Once all the data has been read in, the program should sort the data. The user should be able to choose which algorithm to use to sort the data. The program should print the time before and after the sort. The last part of the program should prompt the user for a lower and upper bound. These two values should then be used to decide how much and which part of the array will be display. You should test all of the sorts on each of the data files. There are a number of files (10numbers.zip, etc.) of increasing size that you can utilize for testing purposes.
Continue to add a a justification of the difference between the run times of each sort when compared to those you're reported on earlier. Include the screenshots of the runtimes on both the million and 10 million element lists (Don't rerun the first four algorithms with the 10 million list). Continue noting the best, worst, and average runtims for all algorithms as well as a justification of why the new algorithms are faster or slower.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
