<?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: Gaby Chaves</title>
    <description>The latest articles on DEV Community by Gaby Chaves (@gabychaves).</description>
    <link>https://dev.to/gabychaves</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%2F1619770%2Fe17d2d9f-20ef-4070-9f98-8284b8960af0.png</url>
      <title>DEV Community: Gaby Chaves</title>
      <link>https://dev.to/gabychaves</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/gabychaves"/>
    <language>en</language>
    <item>
      <title>Big O Notation: Speed Dating for Algorithms</title>
      <dc:creator>Gaby Chaves</dc:creator>
      <pubDate>Thu, 13 Jun 2024 11:56:56 +0000</pubDate>
      <link>https://dev.to/gabychaves/big-o-notation-speed-dating-for-algorithms-3i82</link>
      <guid>https://dev.to/gabychaves/big-o-notation-speed-dating-for-algorithms-3i82</guid>
      <description>&lt;p&gt;&lt;em&gt;This is a submission for DEV Computer Science Challenge v24.06.12: One Byte Explainer.&lt;/em&gt;&lt;/p&gt;

&lt;h2&gt;
  
  
  Explainer
&lt;/h2&gt;

&lt;p&gt;Big O Notation: It’s like speed dating for algorithms. Describes how fast (or slow) an algorithm runs as data grows. Helps you spot the quick ones (O(log n)) and avoid the slowpokes (O(n^2)). Just like in dating, you want the fast and efficient, not the ones that waste your time!&lt;/p&gt;

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