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.
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With