Question: This question wants to find the cost of each algorithm and express the upper bound of the time complexity in Asynptotix notation. 1. Find the



This question wants to find the cost of each algorithm and express the upper bound of the time complexity in Asynptotix notation.
1. Find the cost function of the following algorithm and express the upper bound of the time complexity in asymptotic notation. (2 marks) a. sum=0; for i=0 to n do for j=0 to j = i' do if j mod i == O then sum=sum+1; b. IsPrime(N)//check whether N is a prime number { Int i=3; if N==2 or N==3 then return TRUE; if N mod 2==0 then return FALSE; while i?
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
