Skip to main content

New answers tagged

3 votes

Do edge lists have O(E) storage if default values are used for absent keys?

Just as an initial comment, it's not entirely settled what Bachmann big-oh notation formally means when you have more than one variable. There are multiple competing definitions. But let's leave that ...
Pseudonym's user avatar
  • 22.3k
2 votes

Time complexity of delete and insert operations in a hash table

Deleting is obvious, you need to find the element to delete, that's a lookup. but once you have the element you can delete it in O(1). Part of inserting an element into a hash table tends to include ...
ratchet freak's user avatar
0 votes

Perfect hashing function algorithm

D.W. comment is pertinent. You could use open-addressing or binary search in your ordered set of keys. However, if your concern is performance and constant time fetch, you could think of some perfect ...
nowox's user avatar
  • 245

Top 50 recent answers are included