1. a) In designing and analyzing an algorithm, one fundamentally goes through a sequence [18 Marks] of steps. State thes

[answerhappygod]

1 A In Designing And Analyzing An Algorithm One Fundamentally Goes Through A Sequence 18 Marks Of Steps State Thes 1 (446.21 KiB) Viewed 48 times

1. a) In designing and analyzing an algorithm, one fundamentally goes through a sequence [18 Marks] of steps. State these steps, and for each step give a brief description. b) Provide a formal definition of the following asymptotic notation Big Oh(0), Big Theta(8), and Big Omega(N) (NB: Graphical illustration is not required). [6 Marks] c) Outline the general plan for analyzing the time efficiency of i. a non-recursive algorithm [5 Marks] ii. a recursive algorithm [5 Marks] d) Consider the algorithm below and evaluate its efficiency class ALGORITHM Unique Elements (A[0..n-1]) //Determines whether all the elements in a given array are distinct //Input: An array A[0..n - 1] //Output: Returns "true" if all the elements in A are distinct // and "false" otherwise for i 0 to n - 2 do if A = A[j] return false return true [6 Marks] e) Outline the general plan for the empirical analysis of algorithm time efficiency. [5 Marks] for ji+ 1 to n - 1 do