write a program that will sort the food orders using Mergesort and to report the efficiency of the algorithm. The following are the requirements: Auto-generate the order ids randomly. You may use a random function to generate the order ids. The order id takes the form of: FD9999 (the number of digits might change according to the maximum number of orders, n, that is input by the user). -For each order id, the total cost of the order should also be auto-generated randomly. The total cost of the order will be in the following format: RM999.99. -Sort the orders using Mergesort according to the order ids. Display the list of the unsorted orders and the corresponding total cost of the order (if this option is selected by the user) Display the list of the sorted orders and the corresponding total cost of the order (if this option is selected by the user) - Display the running time of the sorting algorithm. You are required to: a. Implement the scenario above using C/C++ programming language. Do apply the techniques for good programming practices. b. Sample Input: Sample Output (Note: ii and iii can be in the form of a menu option – users can choose this option if they wish to see the values): i. < time taken to perform the sorting> ii. iii.
write a program that will sort the food orders using Mergesort and to report the efficiency of the
Auto-generate the order ids randomly. You may use a random function to generate the order ids. The order id takes the form of: FD9999 (the number of digits might change according to the maximum number of orders, n, that is input by the user).
-For each order id, the total cost of the order should also be auto-generated randomly. The total cost of the order will be in the following format: RM999.99.
-Sort the orders using Mergesort according to the order ids. Display the list of the unsorted orders and the corresponding total cost of the order (if this option is selected by the user) Display the list of the sorted orders and the corresponding total cost of the order (if this option is selected by the user)
- Display the running time of the sorting algorithm. You are required to:
a. Implement the scenario above using C/C++
b. Sample Input: Sample Output (Note: ii and iii can be in the form of a menu option – users can choose this option if they wish to see the values): i. < time taken to perform the sorting> ii. iii.
![](/static/compass_v2/shared-icons/check-mark.png)
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 4 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)