<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[RSS Feed]]></title><description><![CDATA[RSS Feed]]></description><link>https://ecency.com</link><image><url>https://ecency.com/logo512.png</url><title>RSS Feed</title><link>https://ecency.com</link></image><generator>RSS for Node</generator><lastBuildDate>Thu, 30 Jul 2026 09:43:59 GMT</lastBuildDate><atom:link href="https://ecency.com/@ivlad/rss" rel="self" type="application/rss+xml"/><item><title><![CDATA[The Sieve of Eratosthenes Part 1: efficiently generating primes up to n]]></title><description><![CDATA[The Sieve of Eratosthenes is an algorithm for finding prime numbers in a range. Conceptually, it's a very simple algorithm. Let's assume our range is always [2, n]. In our examples, we'll consider n=100. ]]></description><link>https://ecency.com/@ivlad/the-sieve-of-eratosthenes-part-1-efficiently-generating-primes-up-to-n</link><guid isPermaLink="true">https://ecency.com/@ivlad/the-sieve-of-eratosthenes-part-1-efficiently-generating-primes-up-to-n</guid><category><![CDATA[programming]]></category><dc:creator><![CDATA[ivlad]]></dc:creator><pubDate>Wed, 04 Apr 2018 10:15:48 GMT</pubDate><enclosure url="https://i.ecency.com/p/5k2tWE6P7gjtWGNDHKvBHJvQxDKSGhHqmhHd28cN?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[How to find a second best Minimum Spanning Tree]]></title><description><![CDATA[A Minimum Spanning Tree (MST) of a weighted graph G(V, E) is a tree obtained by removing some edges in G such that the sum of the weights of the resulting tree's edges is as small as possible. In this]]></description><link>https://ecency.com/@ivlad/how-to-find-a-second-best-minimum-spanning-tree</link><guid isPermaLink="true">https://ecency.com/@ivlad/how-to-find-a-second-best-minimum-spanning-tree</guid><category><![CDATA[algorithms]]></category><dc:creator><![CDATA[ivlad]]></dc:creator><pubDate>Mon, 26 Mar 2018 21:14:24 GMT</pubDate></item></channel></rss>