0

Let's say you do the following:

for row in myListofLists: if tuple(row) in myDictWithTupleKeys:

in other words, within a loop through the rows of an n x n array, you check to see if a row is contained as a key within a dict. Is this an O(n^2) operation? In other words, is the in operator an O(n) operation here?

Improve this question
4
  • 1
    Does this answer your question? How does python compute the hash of a tuple or How does hash() compute the hash of a tuple? Commented Aug 12, 2023 at 23:16
  • So a tuple's hash depends on the hash of its elements, and that can also be some large number deep @jtbandes, but presumably, in a simple tuple of integers, that makes it O(n) the tuple size, assuming the hash of ints is an O(1) operation? Commented Aug 12, 2023 at 23:19
  • 2
    That is correct. Commented Aug 12, 2023 at 23:19
  • 1
    tuple(row) is already O(n) anyway. Commented Aug 13, 2023 at 2:25
Load 3 more related questions Show fewer related questions

0

Reset to default

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.