Add the methods insert and remove to the Array class.

Add the methods insert and remove to the Array class. These methods should use the strategies discussed in this chapter, including adjusting the length of the array, if necessary. The insert method expects a position and an item as arguments and inserts the item at the given position. If the position is greater than or equal to the array’s logical size, the method inserts the item after the last item currently available in the array. The remove method expects a position as an argument and removes and returns the item at that position. The remove method’s precondition is 0 <= index=””>< size().=”” the=”” remove=”” method=”” should=”” also=”” reset=”” the=”” vacated=”” array=”” cell=”” to=”” the=”” fill=””>

find the cost of your paper

Suggest a modification of the binary search algorithm that emulates this strategy for a list of names.

1. Suppose that a list contains the values 20 44 48 55 62 66 74 88 93 99 at index positions 0 through 9. Trace the values of the variables….

Explain why insertion sort works well on partially sorted lists.

1. Which configuration of data in a list causes the smallest number of exchanges in a selection sort? Which configuration of data causes the largest number of exchanges? 2. Explain….

Draw a class diagram that shows the relationships among the classes in this new version of the system

Jack decides to rework the banking system, which already includes the classes BankView, Bank, SavingsAccount, and RestrictedSavingsAccount. He wants to add another class for checking accounts. He sees that savings….