Sorted and Unsorted List CPP File

The code defines two classes, `UnsortedList` and `SortedList`, to manage collections of integers. ### UnsortedList - **Constructor/Destructor**: Initializes the list with a length of 0. - **insertItem(int id)**: Inserts an integer at the end of the list and increments the length. - **deleteItem(int id)**: Searches for an item; if found, it replaces it with the last element and decrements the length. If not found, it outputs a message. - **isFull() / isEmpty()**: Checks if the list is full or empty based on its length. - **displayList()**: Displays all items in the list or indicates if the list is empty. ### SortedList - **Constructor/Destructor**: Initializes the list with a length of 0. - **insertItem(int item)**: Uses binary search to find the correct insert position, shifts elements, and adds the item to maintain order. - **binarySearch(int item)**: Implements a binary search algorithm to locate the position for inserting an item. - **deleteItem(int item)**: Uses linear search to find and remove an item, shifting remaining elements and updating the length. - **linearSearch(int item)**: Searches for an item and returns its location. - **isFull() / isEmpty()**: Checks if the list is full or empty. - **displayList()**: Outputs each number in the list. Both classes manage integers and offer basic functionalities such as insertion, deletion, and display of the list, accommodating both unsorted and sorted data structures.