Thread

1. ancientstraits · 1790728534 · focus · HN ↗

   The &quot;how to implement a hash table&quot; article <a href="https:&#x2F;&#x2F;benhoyt.com&#x2F;writings&#x2F;hash-table-in-c&#x2F;" rel="nofollow">https:&#x2F;&#x2F;benhoyt.com&#x2F;writings&#x2F;hash-table-in-c&#x2F; was really helpful for me. I thought that hash tables were something that were basically impossible to make in C, but this showed that it was simpler.

   1. dprkh · 1790729301 · focus · HN ↗

      Arrays are hash tables. You can implement a very simple hash table from a tutorial, but can you implement a sophisticated one? What about a concurrent hash table?

      1. fodkodrasz · 1790749397 · focus · HN ↗

         &gt; Arrays are hash tables.

         Maybe in JavaScript... but there is a topic called datastructures, where arrays are arrays, and hashtables are hastables. If people say this without a flip of an eye I&#x27;m not surprised why people write stuff like

         &gt; I thought that hash tables were something that were basically impossible to make in C

         1. moregrist · 1790753148 · focus · HN ↗

            In a trivial sense, arrays are hash tables with a hash function of the identity f(x)=x.

            It’s just not particularly common (or helpful) to view them that way.

            1. dprkh · 1790893688 · focus · HN ↗

               In LeetCode, it&#x27;s a very common optimization. If your key values are dense, you use an array. If your key values are sparse, you use a dict.

Unofficial Hacker News client; not affiliated with Y Combinator.