Assignment Submission $($must submit both$)$:

Soft copy, including your C$++$ code $($with comments and screenshots of the

output$).$ The code should be copied and pasted, not a screenshot

Printed copy at the beginning of the class

Name the submitted file in the following format LastName CSCI$215$ HW$3.$

Question $(4$ Pts$.)$: Write a program that maintains its data $($of type double$)$ sorted in

ascending order. The program will consist of three functions: insert, delete, and print.

You may use any data structure of your choice as long as the data remains sorted after each

operation. Regardless of the order the numbers are inserted, they must be stored in the data

structure in ascending order. This means that the data structure contains sorted data, not

that the print will be in order while the data is not.

Analyze the problem,

and the complexity of it and its operations $($Big$-$O$),$ to solves the problem.

For example, if $5\mathrm{.}0$ is inserted then $2\mathrm{.}9,$ the structure should contain $2\mathrm{.}9$ then $5\mathrm{.}0,$ and this

is what the print function should show. If $3\mathrm{.}3$ is inserted afterwards, then we should have

$2\mathrm{.}9,3\mathrm{.}3,5\mathrm{.}0.$ Same for deletion, of course the structure will remain sorted, but any deleted

number should be removed and excluded from printing.

Capture screenshots of the operations below:

Insert $5\mathrm{.}0$ then $2\mathrm{.}9$ then $3\mathrm{.}3($in this order$)$ and print the content after each insertion.

The printed list should be sorted in every print call.

Delete $3\mathrm{.}3,$ then print the content again.