Question: C++ Implement SortedList Two lists List1 and List2 ordered in ascending order. Implement the mergeList function and get a new list3 ordered in a row

C++
Implement SortedList
Two lists List1 and List2 ordered in ascending order. Implement the mergeList function and get a new list3 ordered in a row List3.mergeList (List1, List2);
ADT Sorted List Operation List Implementation Array-based Link-based insertSorted newEntry) removeSorted(anEntry) getPosition (anEntry) getEntry(position) remove (givenPosition) clear) getLength), isEmptyO O(n) O(n) O(n) O(n) ou) 0l) dir O(R) on) O(R) Ol)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
