What is the difference between the worst case time complexity of Find vs FindId?
Is it the same?
Is it O(n), O(1), or something else?
dn.aur
(Dan)
2
from experience I can tell you that with increasing number of objects finding objects gets slower and slower, so it is O(n) probably
1 Like