Jimmy is creating a program where he will have an array of only 100 items. The items will change in the array, but will never be more than 100 items. When he inserts new items, the new item is inserted where the older item was deleted, and then the items are resorted. He will need the items sorted after each item he inserts. For finding items he is of course using binary search. What would be a good sorting algorithm to use for this array? Explain your answer in at least 3 sentences.