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 computer program using C++ to compute the expression (n*(2^m!)), Where n, m are positive integers and n>m21. Hint: Write a function to compute the factorial as in example below, and then call this function within the main () to compute the * ?factorial when needed
Given a list of n integers, write a C++ program to sort these integers usingmerge sort. Print to the screen the sorted list.The program requires that integers in the list are from user input. You can make theassumption that user input numbers are all integers and there is no improper input. Additional requirements and reminders (IMPORTANT): 1) You must use the merge sort algorithm to sort the list of integers. You mustuse recursion in your program.2) The list of integers must from user input. You may not hardcode it in your program.
Program in C++ only: You are given a series S of small English letters in length N. You are allowed (but not required) to select one index from this series and convert the letter in this index into another English character. The cost of this work is the sum of the ASCII price differences of the new character and the actual character; let's show it with an X. Next, consider the number of index pairs (i, j) in the resulting character unit (series after changing one character, or the original character unit if there is no altered character) so that 1si
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 program in C++ to print even or odd numbers in given range using recursion. Test Data: Input the range to print starting from 1: 10 Expected Output: All even numbers from 1 to 10 are: 2 4 68 10 All odd numbers from 1 to 10 are: 1 3 5 79 1/1
Write a C++ program that counts the number of even digits (including the number of zeros) and oddsfrom a given list of digits. Your program should ask first for the number of digits of a list. Then ask toenter each digit according to the given list. The program should display the total number of evennumbers, zeros, and odd numbers. This program should be general-purpose and print the desired inputfor any given list. The desired output of the program is the following. Example output:Please mention the total number of integers to enter (from the list of positive, negative, or zeros) = 10Please now enter the list of all 10 numbers:70-416-6005-7There are total 6 evens which includes 3 zeros.The total odd numbers you have entered is: 4 FOR LOOP should be used for iterations. Arrays, functions and goto statements are NOT allowed.
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 and implement the following: Create a vector of integers and insert 1000 random integers into that. Sort the numbers in the vector in different ways: - With the bubble sort algorithm. - With the quicksort algorithm. Measure the running time for each case - With the quicksort algorithm.
Write a C program to find sum of n elements entered by user. To perform this program, allocate memory dynamically using malloc() function and before exiting the program we will release the memory allocated at run time by using free() function.