write a c++ program that will sort the food orders using Mergesort and to report the efficiency of the algorithm • Auto-generate the order ids randomly. You may use a random function to generate theorder ids. The order id takes the form of: FD9999 (the number of digits might changeaccording 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. Thetotal 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 thisoption is selected by the user)Display the list of the sorted orders and the corresponding total cost of the order (if thisoption 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 thetechniques 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 thisoption if they wish to see the values):i. ii. iii. In your report:c. Write a pseudocode for your solution above. Do ensure that the pseudocode models theentire logical flow of your program.d. Illustrate the growth of the algorithm by:i. providing a table that reports the growth of the sorting algorithm in theimplementation above; andii. plot a graph to illustrate the growth of the sorting algorithm.To illustrate the growth of your sorting algorithm, run the program with at least thefollowing n values (n represents the number of order ids that was generated): 1,000; 5,000;32,000; 512,000; 1,000,000. The growth of the algorithm is typically measured inmillisecond (ms) or microsecond (us) or nanosecond (ns).The growth rate of your sorting algorithm may vary due to your processor speed, memorycapacity and etc. Therefore, to illustrate the consistency of the growth rate of your program,you will need to perform and report a minimum of 5 trial runs on each of the n values. Youmay then take the average of the running time for plotting the graph and for the discussionin the section below.e. Based on the growth rate for various n values above, your Team Lead has asked you towrite a detailed justification of the performance of the Mergesort algorithm. Yourjustification could focus on your observation of (but not limited to) the performance of thealgorithm with various n values and why (your observation should be supported byevidence of wider reading). Your Team Lead has also asked you to reflect on whether thereare sorting algorithms that could potentially perform better than the Mergesort algorithm.Provide and justify your recommendation. You should justify your answers with evidencefrom your implementation and from other scholarly resources that you have referred to. Besure to cite and reference your sources accurately and using the correct referencingstandards.

#include<iostream>#include<stdlib.h>#include<time.h>#include<bits/stdc++.h>u…

Answered: write a c++ program that will sort the…

Engineering

Computer Science

write a c++ program that will sort the food orders using Mergesort and to report the efficiency of the algorithm

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Write a C++ program that implements Insertion sort algorithm to arrange a list of integers in ascending order. .Please describe the code in details by which I can understand it well and add screenshot of the output.
SOLVE IT USING C PROGRAMMING
C/C++ & MIPS The function ?add(?,?) for two positive integers 0≤?, and 0≤?, is defined as the following:?add(?,0)=?; ?add(?,?)=?add(?,?−1)Write a recursive version of ?add() in C or C++, then use this program to develop a MIPSprogram that gets as input two integers 0<? ≤255, and 0<? ≤255, and returns theresult of ?add(?,?) in $v1.Your deliverable should be the C/C++ code and the MIPS assembly function-code
Write a c ++ program for pattern searching by using knuth morris pratt algorithm.
c++
Write a program in c++ that takes five student's quizzes in a course. Consider each student has given ten quizzes. Find 1. Best student 2. Worst student 3. Average student
write a C++ program that can add two matrices of 10 rows and 10 columns, all of which are integers.
Write a C++ program to produce the first 90 Fibonacci numbers. A Fibonacci number is one that I is the product of the prior two generated numbers. The sequence is seeded with the values of O and 1, so that the sequence starts off as 0 1123. Fibonacci numbers are used in computing hash table locations for file management systems.
Write a C++ program that sorts an unsorted list of twenty integers. Do not use the vector library for this assignment. The program must have one function using a bubble sort or a selection sort algorithm to sort the twenty numbers. The main( ) creates an array of twenty integers that are not sorted. Next, the function is called to sort the numbers in ascending order. Finally, the main( ) displays the sorted list.
write a C++ program to read N numbers; find the a nearest larger number of X by using a binary search algorithm.
write a C++ program to create a doubly linked list of 6 element with any random order. You have to generate the sorted output in Ascending order. Perform the Following Algorithm.⦁ Bubble Sort⦁ Insertion Sort