<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
    <title>algorithms</title>
    <link rel="self" type="application/atom+xml" href="https://links.biapy.com/guest/tags/1365/feed"/>
    <updated>2026-05-01T00:29:55+00:00</updated>
    <id>https://links.biapy.com/guest/tags/1365/feed</id>
            <entry>
            <id>https://links.biapy.com/links/12289</id>
            <title type="text"><![CDATA[Algorithm Visualizer]]></title>
            <link rel="alternate" href="https://algorithm-visualizer.org/" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/12289"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[🎆Interactive Online Platform that Visualizes Algorithms from Code.

Welcome to Algorithm Visualizer, an interactive online platform designed to bring algorithms to life through visualization. Whether you&amp;#039;re a student, teacher, or professional, our platform provides an engaging way to explore and understand various algorithms.

- [Algorithm Visualizer @ GitHub](https://github.com/algorithm-visualizer/algorithm-visualizer).]]>
            </summary>
            <updated>2026-03-25T13:38:02+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/10332</id>
            <title type="text"><![CDATA[JavaScript Algorithms and Data Structures]]></title>
            <link rel="alternate" href="https://github.com/trekhleb/javascript-algorithms" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/10332"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[📝 Algorithms and data structures implemented in JavaScript with explanations and links to further readings.

Related contents:

- [5 GitHub Repositories for an Instant Knowledge Boost @ Surajondev](https://www.surajon.dev/5-github-repositories-for-an-instant-knowledge-boost).]]>
            </summary>
            <updated>2025-09-22T06:41:54+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/2025</id>
            <title type="text"><![CDATA[Raft Consensus Algorithm]]></title>
            <link rel="alternate" href="https://raft.github.io/" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/2025"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[Raft is a consensus algorithm that is designed to be easy to understand. It&amp;#039;s equivalent to Paxos in fault-tolerance and performance. The difference is that it&amp;#039;s decomposed into relatively independent subproblems, and it cleanly addresses all major pieces needed for practical systems. We hope Raft will make consensus available to a wider audience, and that this wider audience will be able to develop a variety of higher quality consensus-based systems than are available today. 

Related contents:

- [Zero Disk - L&amp;#039;architecture du futur sans stockage local @ Korben :fr:](https://korben.info/zero-disk-architecture-stockage-cloud-s3.html).
- [Zero Disk Architecture @ Avi.im blag](https://avi.im/blag/2024/zero-disk-architecture/).]]>
            </summary>
            <updated>2025-08-28T21:34:12+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/3179</id>
            <title type="text"><![CDATA[TheAlgorithms/Python]]></title>
            <link rel="alternate" href="https://thealgorithms.github.io/Python/" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/3179"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[All Algorithms implemented in Python.

Implementations are for learning purposes only. They may be less efficient than the implementations in the Python standard library. Use them at your discretion.

- [TheAlgorithms/Python @ GitHub](https://github.com/TheAlgorithms/Python).]]>
            </summary>
            <updated>2025-08-29T00:46:37+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/7222</id>
            <title type="text"><![CDATA[Kwyk]]></title>
            <link rel="alternate" href="https://www.kwyk.fr/algorithme/" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/7222"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[Exercices d’algorithmique basés sur Scratch]]>
            </summary>
            <updated>2025-08-29T12:00:32+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/7223</id>
            <title type="text"><![CDATA[Compute It]]></title>
            <link rel="alternate" href="https://compute-it.toxicode.fr/" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/7223"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[Let&amp;#039;s switch roles: this time YOU are the computer !]]>
            </summary>
            <updated>2025-08-29T12:02:30+00:00</updated>
        </entry>
    </feed>
