<?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: Funwie Blaise </title>
    <description>The latest articles on DEV Community by Funwie Blaise  (@funwieblaise).</description>
    <link>https://dev.to/funwieblaise</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%2F1458013%2Fb01e9dbb-4a10-45f2-a0f3-83f9dd0d0c93.png</url>
      <title>DEV Community: Funwie Blaise </title>
      <link>https://dev.to/funwieblaise</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/funwieblaise"/>
    <language>en</language>
    <item>
      <title>Big O notation</title>
      <dc:creator>Funwie Blaise </dc:creator>
      <pubDate>Wed, 19 Jun 2024 04:46:01 +0000</pubDate>
      <link>https://dev.to/funwieblaise/big-o-notation-3d39</link>
      <guid>https://dev.to/funwieblaise/big-o-notation-3d39</guid>
      <description>&lt;p&gt;&lt;em&gt;This is a submission for &lt;a href="https://dev.to/challenges/cs"&gt;DEV Computer Science Challenge v24.06.12: One Byte Explainer&lt;/a&gt;.&lt;/em&gt;&lt;/p&gt;

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

&lt;p&gt;Big O notation is a tool used to analyze the efficiency of algorithms based on how their performance scales with input size. It helps developers make informed decisions about algorithm selection and optimization for better performance with large datasets.&lt;/p&gt;

&lt;h2&gt;
  
  
  Additional Context
&lt;/h2&gt;

</description>
      <category>devchallenge</category>
      <category>cschallenge</category>
      <category>computerscience</category>
      <category>beginners</category>
    </item>
    <item>
      <title>Big O notation</title>
      <dc:creator>Funwie Blaise </dc:creator>
      <pubDate>Wed, 19 Jun 2024 04:41:56 +0000</pubDate>
      <link>https://dev.to/funwieblaise/big-o-notation-4gck</link>
      <guid>https://dev.to/funwieblaise/big-o-notation-4gck</guid>
      <description>&lt;p&gt;Big O notation is a way to analyze the efficiency of algorithms by describing how their runtime or space requirements grow as the input size increases. It is crucial for designing and optimizing algorithms to ensure they perform well with large datasets, helping developers make informed decisions about which algorithm to use in different scenarios.&lt;/p&gt;

&lt;h2&gt;
  
  
  Additional Context
&lt;/h2&gt;

</description>
      <category>devchallenge</category>
      <category>cschallenge</category>
      <category>computerscience</category>
      <category>beginners</category>
    </item>
    <item>
      <title>Wisdom</title>
      <dc:creator>Funwie Blaise </dc:creator>
      <pubDate>Thu, 02 May 2024 14:06:12 +0000</pubDate>
      <link>https://dev.to/funwieblaise/wisdom-4nbj</link>
      <guid>https://dev.to/funwieblaise/wisdom-4nbj</guid>
      <description>&lt;p&gt;"True wisdom is not just knowing how to code, but understanding the impact of your code on the world around you."&lt;/p&gt;

</description>
    </item>
  </channel>
</rss>
