Question: answer both Ex1 and Ex4 (20 points) Find the running time functions for the algorithms below and write their classification using Big-O asymptotic notation. The


answer both Ex1 and Ex4
(20 points) Find the running time functions for the algorithms below and write their classification using Big-O asymptotic notation. The running time function should provide a formula on the number of operations performed on the variable s. Note that array indices start from 0 Algorithm Ex1 (A) Input: An array A storing n 2 1 integers. Output : The sum of the elements in A st-A10] for i1to n_1do st, s + Ali] end for return s
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
