Question: 2. Assume that our input array A contains both numbers and letters. We will analyze a variant of insertion sort (SPLITINSERTIONSORT) that outputs two lists:

2. Assume that our input array A contains both numbers and letters. We will analyze a variant of insertion sort (SPLITINSERTIONSORT) that outputs two lists: one with only numbers and another with only letters. Naturally, each list will be sorted (a) 10 pts Write pseudocode for SPLITINSERTIONSORT (b) 10 pts Write a recurrence equation for this algorithnm c) Extra credit (5 pts): Use the recurrence equation above to prove the worst-case running time of this algorithm
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
