Veselin panayotov final project presentation final
Pizza ordering simulation program.
Class Food created. Queue template class created. Queue data structure used. Data stored in STRUCs as part of the Food class Linked list class used to implement the Queue class Dynamic array used for manipulate the customerorders. Performing Searching and sorting. Counting time to finish cooking (in progress)
The user has been show a list of Pizzas to choose from.(Pizzas stored in an array) After each selection the user is asked do they want tocontinue choosing from pizza section? If “Yes” the selection continues until customer decidesto stop (select “No”). After that second array is visualized to show Sides(appetizers) to choose from.
While the customer choosing an items every single oneis send to a Queue that stores it. When the whole selection process is done a Dynamicarray is created the data from the Queue is send to it. Once the dynamic array is filled with data a searched isperformed to determine the element with lowest “timeto cook” a swap is done immediately after that so theobject with lowest cooking time is placed on firstposition.
Finally selection sort is performed to present all theordered items in ascending order sorted by cookingtime.