<?xml version="1.0"?>
<rss version="2.0">
   <channel>
      <title>3 FAMOUS ALGORITHMS  by chris keats kanyitochukwu dahsklog uzoezie</title>
      <link>https://padlet.com/oreongu/cdn4q6uwikao</link>
      <description>fran solana y chris uzoezie</description>
      <language>en-us</language>
      <pubDate>2018-10-31 08:05:00 UTC</pubDate>
      <lastBuildDate>2021-07-10 18:23:25 UTC</lastBuildDate>
      <webMaster>hello@padlet.com</webMaster>
      <image>
         <url></url>
      </image>
      <item>
         <title></title>
         <author>oreongu</author>
         <link>https://padlet.com/oreongu/cdn4q6uwikao/wish/302452700</link>
         <description><![CDATA[<div> </div><div>Sieve of Eratosthenes: algorithm steps for primes below 121 (including optimization of starting from prime's square).</div><div><br>In <a href="https://en.wikipedia.org/wiki/Mathematics">mathematics</a>, the <a href="https://en.wikipedia.org/wiki/Sieve_theory"><strong>sieve</strong></a><strong> of Eratosthenes</strong> is a simple, ancient <a href="https://en.wikipedia.org/wiki/Algorithm">algorithm</a> for finding all <a href="https://en.wikipedia.org/wiki/Prime_number">prime numbers</a> up to any given limit. <br> t does so by iteratively marking as <a href="https://en.wikipedia.org/wiki/Composite_number">composite</a>  the multiples of each prime, starting with the first prime number  The multiples of a given prime are generated as a sequence of numbers starting from that prime, with <a href="https://en.wikipedia.org/wiki/Arithmetic_progression">constant difference between them</a> that is equal to that prime .</div>]]></description>
         <enclosure url="" />
         <pubDate>2018-11-09 08:12:51 UTC</pubDate>
         <guid>https://padlet.com/oreongu/cdn4q6uwikao/wish/302452700</guid>
      </item>
      <item>
         <title></title>
         <author>oreongu</author>
         <link>https://padlet.com/oreongu/cdn4q6uwikao/wish/302453504</link>
         <description><![CDATA[<div> In <a href="https://en.wikipedia.org/wiki/Mathematics">mathematics</a>, the <strong>Euclidean algorithm</strong>  is an efficient method for computing the <a href="https://en.wikipedia.org/wiki/Greatest_common_divisor">greatest common divisor</a> (GCD) of two numbers, the largest number that divides both of them without leaving a <a href="https://en.wikipedia.org/wiki/Remainder">remainder</a>. It <br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2018-11-09 08:16:03 UTC</pubDate>
         <guid>https://padlet.com/oreongu/cdn4q6uwikao/wish/302453504</guid>
      </item>
      <item>
         <title></title>
         <author>oreongu</author>
         <link>https://padlet.com/oreongu/cdn4q6uwikao/wish/302453971</link>
         <description><![CDATA[<div> <strong>Rubik's Cube</strong> is a <a href="https://en.wikipedia.org/wiki/Three-dimensional_space">3-D</a> <a href="https://en.wikipedia.org/wiki/Combination_puzzle">combination puzzle</a> invented in 1974  by Hungarian sculptor and professor of architecture <a href="https://en.wikipedia.org/wiki/Ern%C5%91_Rubik">Ernő Rubik</a>. Originally called the <strong>Magic Cube</strong>  the puzzle was licensed by Rubik to be sold by <a href="https://en.wikipedia.org/wiki/Ideal_Toy_Company">Ideal Toy Corp.</a> in 1980  via businessman Tibor Laczi and Seven Towns founder <a href="https://en.wikipedia.org/wiki/Tom_Kremer">Tom Kremer</a>  and won the <a href="https://en.wikipedia.org/wiki/Spiel_des_Jahres">German Game of the Year</a> special award for Best Puzzle that year. As of January 2009, 350 million cubes had been sold worldwide  making it the world's top-selling puzzle game </div>]]></description>
         <enclosure url="" />
         <pubDate>2018-11-09 08:17:54 UTC</pubDate>
         <guid>https://padlet.com/oreongu/cdn4q6uwikao/wish/302453971</guid>
      </item>
   </channel>
</rss>
