Objective:

This activity has the purpose of helping students to implement

sorted lists with links $($dynamic memory$).($Objective $4).$

Students Instructions:

After studying this module, write the answer to the following

programming assignments in a text file and submit them as an

attached Word doc or PDF through the provided link in

Blackboard. The deadline for submitting this assignment is

indicated on "Tools", which is located in "Calendar" in the

"Blackboard" platform. You will have two $(2)$ attempt to send

your answers by Assignment link before the deadline and the

last submission would be considered as your final solution. This

exercise has $60$ points.

Question: Write an implementation of the ADT sorted list that

uses a resizable array $($vector class of $C++STL)$ to represent

the list items. Anytime the list becomes full, double the size of

the array.