<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: ElectroHolmes</title>
    <description>The latest articles on DEV Community by ElectroHolmes (@electroholmes).</description>
    <link>https://dev.to/electroholmes</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F533342%2Ff0c8df79-0353-4b86-87bc-b9a8328336c3.jpeg</url>
      <title>DEV Community: ElectroHolmes</title>
      <link>https://dev.to/electroholmes</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/electroholmes"/>
    <language>en</language>
    <item>
      <title>From Chaos to Order: The Art of Hashing in CS</title>
      <dc:creator>ElectroHolmes</dc:creator>
      <pubDate>Sat, 15 Jun 2024 20:13:02 +0000</pubDate>
      <link>https://dev.to/electroholmes/from-chaos-to-order-the-art-of-hashing-in-cs-1h0j</link>
      <guid>https://dev.to/electroholmes/from-chaos-to-order-the-art-of-hashing-in-cs-1h0j</guid>
      <description>&lt;h2&gt;
  
  
  &lt;u&gt;&lt;em&gt;Hashing in Computer Science&lt;/em&gt;&lt;/u&gt;
&lt;/h2&gt;

&lt;h3&gt;
  
  
  By utilizing a hash function, hashing encodes input data into a fixed-size value (hash). For swift information retrieval, it is implemented in data structures such as hash tables. An efficient lookup is ensured by good hashing, which reduces collisions—the situation in which two inputs result in the same hash.
&lt;/h3&gt;

</description>
      <category>devchallenge</category>
      <category>cschallenge</category>
      <category>computerscience</category>
      <category>beginners</category>
    </item>
  </channel>
</rss>
