One common way to implement a list is using an array. This project is to work with an ordered list. An ordered list is a list on which all the elements are stored in ascending order, which is a bit more efficient than an unordered list in performing some operations such as lookup. To preserve its property, one should always insert a new element at the proper position.
see attached file
The sequence of elements is shown.