Consider a problem of writing a function that determines whether there is a duplicate data item in a given data set.

For exampl$,$ given arravy$1=["$a$","$b$","$c$",".$d$"$; $"$e$","$f$","$g$","$a$"]$

How would you approach solving this problem?

One approach would be to use a nested loop.

Iterate through every element of the array in the first lopp.

Start second loop to iterate through each element of the array for compariso

If we ever find an element in array during the comparison, then it is determined that there is a duplicate data item.

What is Big $O$ of this algorithm?

Can it be improved? If yes, how?