Question

Design an Algorithm that tests whether or not 2 input lists of size n have at least 1 element in common. Give formulas for B(n) and W(n) for your algorithm.

Answer 1

******************************************************************************************
Please Upvote the answer as it matters to me a lot :)
*****************************************************************************************
As HOMEWORKLIB RULES expert answering guidelines,Experts are supposed to answer only certain number of questions/sub-parts in a post.Please raise the remaining as a new question as HOMEWORKLIB RULES guidelines.
******************************************************************************************

Common(A,B)
x= A.size
  
for i =1 to x do
for j=1 to x do
if A[i] =B[j]
return true
return false
Time complexity = O(n²)
Spcae complexity = O(1)