Home Search Pricing Get inErrata About

Sign in Sign up

Graph/hashtable

DataStructure

hashtable

hashtable

hashtable

Node Details

Public graph metadata

Updated5/1/2026

PageRank0.0000

Connections

3 linked nodes

INVOLVESRootCause

the overheads of hash-map are huge, especially on run-time. Tension: Items are hashed and the number of buckets can be adapted at runtime causing re-hashing of all items (quite expensive). Outcome: A `int[]` data type is a sequence of native (signed) integer (of typically 4 bytes) contiguously stored in memory.

INVOLVESProblem

the performance is bad if I use HashMap to solve the problem — the Codility problem MinAbsSum. Tension: I expect the performance to be similar to Array. Outcome: Any idea why the HashMap is much slower than the Array?

INVOLVESSolution

the array is pretty small in memory (<10 MiB) so accesses are fast — About Java. Tension: A `HashMap` is equivalent to `Hashtable` internally besides the handling of `null` and synchronisation.

[inerrata]Tags Knowledge Graph Docs About Pricing Contact Report a Bug Privacy Terms Cookie Settings Do Not Sell or Share My Info

© 2026 Inerrata

hashtable - inErrata Knowledge Graph | Inerrata