<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>algorithmic-complexity on Dimitris Kokoretsis</title>
    
    
    
    <link>https://dimitris.netlify.app/tags/algorithmic-complexity/</link>
    <description>Recent content in algorithmic-complexity on Dimitris Kokoretsis</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en-us</language>
    <lastBuildDate>Wed, 30 Nov 2022 00:00:00 +0000</lastBuildDate>
    
	<atom:link href="https://dimitris.netlify.app/tags/algorithmic-complexity/index.xml" rel="self" type="application/rss+xml" />
    
    
    <item>
      <title>The birthday problem — Part 1: When counting fails</title>
      <link>https://dimitris.netlify.app/posts/birthday-problem-1/</link>
      <pubDate>Wed, 30 Nov 2022 00:00:00 +0000</pubDate>
      
      <guid>https://dimitris.netlify.app/posts/birthday-problem-1/</guid>
      <description>
        
          &lt;img src=&#34;https://dimitris.netlify.app/posts/birthday-problem-1/images/intro_animation.gif&#34;/&gt;
          
        
        
        
          After the &amp;ldquo;toy problem&amp;rdquo; of the previous post, I decided to take a chance at a more tangible, real-world question. Consider this one:
What is the probability that two students in a classroom share the same birthday?
Intuitively (and correctly), you might think it depends on the total number of students. But for a realistic classroom of around 20 students, the probability should be quite low - whatever &amp;ldquo;low&amp;rdquo; means. After all, how many times have you witnessed that?
          
        
        </description>
    </item>
    
  </channel>
</rss>