Math and computer -Combinatorial Algorithms

there are some question about to answer,all about algorithms. for example: Consider the array (3, -5, 6, 1, -10, 2, 7, -3, 4, 4, -1, 7, -8, 9, 1, -19), as input for the maximum subarray problem. First trace the D&C algorithm presented in class. How many adds and comparisons occurred? Next, look up Kadane’s algorithm on the web. Trace this algorithm, taking note of the total number of steps required. Which algorithm was more efficient for this input (would run faster)? Which algorithm is faster asymptotically? This is one question in pdf. All question is on the [login to view URL] which I already upload