Odpowiedzi na post #4 989

ANightOwl

Jason Thor Hall / PirateSoftware / Maldavius Figtree / DarkSphere Creations / Maldavius / Thorwich / Witness X / @PotatoSec

Lookup is O(1) in both cases. Adding or removing items in the array is O(n) and O(1) with the dictionary. It's not less efficient, in this use...
Wstecz
Top Na dole