If Listing 16.9 were implemented with list instead of vector, what parts of the program would become invalid? Could the invalid part be fixed easily? If so, how?

Transcribed Image Text:

Table 16.9 Some list Member Functions Function void merge (list& x) void remove (const T & val) void sort () void splice (iterator pos, list x) void unique () Description Merges list x with the invoking list. Both lists must be sorted. The resulting sorted list is in the invoking list, and x is left empty. This function has linear-time complexity. Removes all instances of val from the list. This function has linear-time complexity. Sorts the list by using the operator; the complexity is N log N for N elements. Inserts the contents of list x in front of position pos, and x is left empty. This function has constant- time complexity. Collapses each consecutive group of equal elements to a single element. This function has linear-time complexity.