Question 3 a) Give a linear implementation of the following function def find duplicates(lst) The function is given a list lst of n integers All the elements of lst are from the domain 1, 2, , n 1 Note that this restricted domain implies that there are element s appearing in lst more than once The function should return a list containing all the elements that appear in lst more than once For example, if lst 2, 4, 4, 1, 2 , the call find duplicates(lst) could return 2, 4 b) Analyze the worst case running time of your implementation in (a) Question 3 a) Give a linear implementation of the following function def find duplicates (lst) The function is given a list 1st of n integers All the elements of lst are from the domain 1,2, , n 1 Note that this restricted domain implies that there are element s appearing in lst more than once The function should return a list containing all the elements that appear in lst more than once For example, if ist 2, 4, 4, 1, 2 , the call find duplicates (1st) could return 2, 4 b) Analyze the worst case running time of your implementation in (a)

The Answer is in the image, click to view ...

Answered step by step

Verified Expert Solution

Link Copied!

Question

1 Approved Answer

Posted on Sep 25, 2024

Question 3: a) Give a linear implementation of the following function: def find_duplicates(lst) The function is given a list lst of n integers. All the

Question 3: a) Give a linear implementation of the following function: def find_duplicates(lst) The function is given a list lst of n integers. All the elements of lst are from the domain: {1, 2, , n-1}. Note that this restricted domain implies that there are element/s appearing in lst more than once. The function should return a list containing all the elements that appear in lst more than once. For example, if lst=[2, 4, 4, 1, 2], the call find_duplicates(lst) could return [2, 4]. b) Analyze the worst-case running time of your implementation in (a).

image text in transcribed

Question 3: a) Give a linear implementation of the following function: def find duplicates (lst) The function is given a list 1st of n integers. All the elements of lst are from the domain:{1,2, ..., n-1}. Note that this restricted domain implies that there are element/s appearing in lst more than once. The function should return a list containing all the elements that appear in lst more than once. For example, if ist=[2, 4, 4, 1, 2], the call find_duplicates (1st) could return [2, 4]. b) Analyze the worst-case running time of your implementation in (a)