In Exercise 5, you wrote a DeleteAU function for the List type with duplicates. Imple ment a DeleteAll function for the SortedList type that allows duplicates, taking advantage of the fact that all occurrences of the item are stored in adjacent locations in the array. Note that the binary search does not necessarily return the position of the first occurrence of an item; it can return the position of any matching item. Thus, in this case, it may be more efficient to use a linear search to find the starting position for the matching items. Be sure that your function updates the length of the list as necessary.
Exercise 5
Write the implementation of the DeleteAll Function as described in Exercise 4.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.