Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Assume the lists contain hashable objects only.
BTW, I’m not sure if this question makes sense as I am a complete noob when it comes to complexity and academic stuff.
The complexity of comparing two lists is O(n) if both lists have length n, and O(1) if the lists have different lengths.