Question: 2)The following algorithm takes an input array and returns the array after deleting the repeating elements. Example: Input Sequence = [1,3,3,2,4,2] -> Output Sequence =
2)The following algorithm takes an input array and returns the array after deleting the repeating elements. Example: Input Sequence = [1,3,3,2,4,2] -> Output Sequence = [1,3,2,4]
S = new empty set A = new empty dynamic array for every element x in input array if not S.member(x) then S.insert(x) Append(x) return A
Write the Big-O complexity of this algorithm in N type (size of the input array) giving the justification for the following cases.
a) If the cluster is implemented using the AVL tree (10p)
b) If the set is implemented using the hash table (10p)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
