Posted by: nepalinanu2013 April 26, 2013
Login in to Rate this Post:
0
?
not sure if this is the best way to do it:
load the elements to python disctionary ( that would be O(n) operation)
for each element in array, check if it exists in the disctionary , that would be another O(n) operation because hash lookup is O(1)
load the elements to python disctionary ( that would be O(n) operation)
for each element in array, check if it exists in the disctionary , that would be another O(n) operation because hash lookup is O(1)