---
title: "Comment by Enrico Testori on \"Do hash tables really help in reducing time complexity ?\" | Hashnode"
description: "As far as i remember from university, it also depends on what you mean by 'finding' in your scenario. If you need to retrieve a value by key lookup hash"
url: "https://hashnode.com/posts/do-hash-tables-really-help-in-reducing-time-complexity/5ce6c3624accb1d47e53e58d/comment/5ce712f9c059510f3d8c2480"
---

[Discussion](https://hashnode.com/posts/do-hash-tables-really-help-in-reducing-time-complexity/5ce6c3624accb1d47e53e58d)

Comment [Do hash tables really help in reducing time complexity ?](https://hashnode.com/posts/do-hash-tables-really-help-in-reducing-time-complexity/5ce6c3624accb1d47e53e58d)

[Enrico Testori](https://hashnode.com/@hypertesto)

[May 23, 2019](https://hashnode.com/posts/do-hash-tables-really-help-in-reducing-time-complexity/5ce6c3624accb1d47e53e58d/comment/5ce712f9c059510f3d8c2480)

As far as i remember from university, it also depends on what you mean by 'finding' in your scenario.  
If you need to retrieve a value by key lookup hashmaps are perfect, if you want to find within a range then there are other data structures like B+ trees.  
Interesting comparison anyway! Seeing big-O notation made me feel at school again ;-)