Counting sort

Question 1

step through counting sort

Answer 1

step through array A adding 1 to array C at the address of the data at A[i]

then change array C into a cumulative array

then loop through A backwards
subtract 1 from the the data stored in C at address A[i]

Question 2

what are the two main elements of dynamic programming?

Answer 2

overlapping sub problems and searching for an optimal substructure

Question 3

what to do when finding a general solution to a recurrence (specifically like fibby) when there are distinct solutions

Answer 3

add the two together
each with their own coeff