<?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>http://direct.ecency.com</link><image><url>http://direct.ecency.com/logo512.png</url><title>RSS Feed</title><link>http://direct.ecency.com</link></image><generator>RSS for Node</generator><lastBuildDate>Sun, 24 May 2026 02:57:55 GMT</lastBuildDate><atom:link href="http://direct.ecency.com/created/s4107/rss.xml" rel="self" type="application/rss+xml"/><item><title><![CDATA[Overview on Merge Sort]]></title><description><![CDATA[Introduction Merge sort, a divide-and-conquer algorithm, stands out for its stability and consistent performance in sorting arrays. This guide delves into the intricacies of merge sort, exploring its]]></description><link>http://direct.ecency.com/honouree/@joashlim/overview-on-merge-sor</link><guid isPermaLink="true">http://direct.ecency.com/honouree/@joashlim/overview-on-merge-sor</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[joashlim]]></dc:creator><pubDate>Wed, 29 Nov 2023 01:06:33 GMT</pubDate><enclosure url="https://i.ecency.com/p/Bxod1Y9Z4SQy9L7N2mHrsQxGUMSMR9YSLeFproEtCfvNUrMTtG1LrDdC4YKFFyq2aVLKFaAGDk2AQNqj4ir29zGKagZQacoswcMfRYbLnjmdN5S9FrjdXAVuvmpFVZ7cGi6uatFMmfQFL9bLZbL6c3d2Rb2DYRSEMz4i6Ek2V1rxYxoBiGnvwzGpbz68vuHbLmQWNAeAwJBCGxzMHmYw5dtTr6WBWCZJ2n1ryx1bxwVcUVYccf2vSuRdcMJNaLnk8EvfVt2ANwpjvqMpbg5w9vimbAD7YrswUuKpns1c2SGGyr?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Overview on Quick Sort]]></title><description><![CDATA[Introduction Quick Sort, a highly efficient comparison-based sorting algorithm, utilizes a divide-and-conquer strategy to arrange elements within an array. This algorithm selects a 'pivot' element and]]></description><link>http://direct.ecency.com/honouree/@joashlim/overview-on-quick-sort</link><guid isPermaLink="true">http://direct.ecency.com/honouree/@joashlim/overview-on-quick-sort</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[joashlim]]></dc:creator><pubDate>Thu, 23 Nov 2023 16:11:36 GMT</pubDate><enclosure url="https://i.ecency.com/p/qPJmwNUkWBAnomM5pnVR7WiwHjCu7ahkqhSSEo6GzWnZovqKfFEWcEijpdDXw7pyxp4FZKMtBEgMCdbCz3tmuo2RQBycUcRe2SucTYo9XXfXibRwecrwSywBtarEGf3N68pLNmN2xTBpXhdDx3cm7kEUok2M5XtTeqQkDoEgxwFZYSBSoJU3dZc1o7SF2aBHyqY9bH4oL7qJohYqSK9RsbqBfgCw8LnTpJe1Y59ew3qXBPEBVkpD9g1ZmhGUoPzm2HuMMtG1MUXk6wjUiWmo4zjs6zbWzPUzQw3SoJZrXn3gWg4?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Overview on Counting Sort]]></title><description><![CDATA[Introduction This type of sorting algorithm stands out as an efficient, non-comparative, leveraging a unique approach based on the frequency of distinct elements within the input array. This method involves]]></description><link>http://direct.ecency.com/honouree/@joashlim/overview-on-counting-sort</link><guid isPermaLink="true">http://direct.ecency.com/honouree/@joashlim/overview-on-counting-sort</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[joashlim]]></dc:creator><pubDate>Mon, 20 Nov 2023 13:38:24 GMT</pubDate><enclosure url="https://i.ecency.com/p/2SBWhBzuy8917CX919TStusvC1brixe9g5yfwnHayP6N88enVWLLNdodZdeW5mfHUk68SVzeNw4ebbLmtgsEoBnpUzMJ6LGbTaNLLvYhQQu5fywAUjdTsixwJeWPr8hbtTaixchjuBz1z3JS21mXdrz7FybfsB5racX9BeRYPUUkkqsXuYgHxE5r6GGQJzVV9ZV9uTA8dozf9VNpr6BFfsaDRBx39dFpDxbF9W3x3rhbuPVmSRCPFWoPWznbbPFkj5HawVPZEW69YUZW9PXbdrfPySBtyCATDzr2Dz87jfXWbyKhB2ekZo3Txposw8Baj5xZoHjR7AeDWXb233nQm7DX58M5yg2NaLs3KWUaoF9AuY2Uetgdzd1nb6Mge5YV6B5Ky8VWDn?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Overview on Selection Sort]]></title><description><![CDATA[Introduction to Selection Sort Selection Sort is a fundamental comparison-based sorting algorithm that organizes an array by dividing it into two distinct segments: a sorted array and an unsorted array.]]></description><link>http://direct.ecency.com/honouree/@joashlim/overview-on-selection-sort</link><guid isPermaLink="true">http://direct.ecency.com/honouree/@joashlim/overview-on-selection-sort</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[joashlim]]></dc:creator><pubDate>Thu, 16 Nov 2023 12:51:18 GMT</pubDate></item><item><title><![CDATA[Unraveling Sorting Logic with Java's Bubble Sort]]></title><description><![CDATA[In the realm of sorting algorithms, Bubble Sort stands as a fundamental cornerstone. Utilizing a comparison-based approach, it traverses through an array, continually assessing adjacent elements and]]></description><link>http://direct.ecency.com/honouree/@missaquila/unraveling-sorting-logic-with-java-s-bubble-sort</link><guid isPermaLink="true">http://direct.ecency.com/honouree/@missaquila/unraveling-sorting-logic-with-java-s-bubble-sort</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[missaquila]]></dc:creator><pubDate>Wed, 15 Nov 2023 05:32:03 GMT</pubDate><enclosure url="https://i.ecency.com/p/2YRZBi4FZVHekBjEMrU4TJrNAodg61DJiWSphdHqaGRCfeBRDDAUJH2vaLXD1yMtGResirUoyG5Mv5CpbYwupz56WscLQeyTqjt?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Overview on Bubble Sort]]></title><description><![CDATA[Introduction to Bubble Sort Bubble Sort is a straightforward sorting technique based on comparisons that involves iteratively traversing a list of elements to be organized. It examines adjacent elements]]></description><link>http://direct.ecency.com/honouree/@joashlim/introtobubblesort</link><guid isPermaLink="true">http://direct.ecency.com/honouree/@joashlim/introtobubblesort</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[joashlim]]></dc:creator><pubDate>Tue, 14 Nov 2023 15:07:21 GMT</pubDate><enclosure url="https://i.ecency.com/p/7DceLgR4szFyHjpUosTQ7fbFkuvbYmghJ4hxLy4SSnTophytfM6kemevCxd9VvfKSSYoiwtRNUggD5TNmcPBt?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Understanding the Heap Data Structure]]></title><description><![CDATA[Introduction In computer science, the term "heap" refers to a specific data structure that plays a critical role in various algorithms and applications. It is important to note that the heap]]></description><link>http://direct.ecency.com/honouree/@jacfloresca15/understanding-the-heap-data-structure</link><guid isPermaLink="true">http://direct.ecency.com/honouree/@jacfloresca15/understanding-the-heap-data-structure</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[jacfloresca15]]></dc:creator><pubDate>Fri, 10 Nov 2023 02:32:06 GMT</pubDate><enclosure url="https://i.ecency.com/p/HNWT6DgoBc14sFGBy4hR9KYexjXX4EGqJPx4inaizBxJFbwXtyfZBrD2sBSGZjv13FGXR8wifKhDobxca6DBEDJKKVct7Sth7KADgqvmkijtm2ngspE5f3rWs5Y?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Queue Data Structure: Concepts, Operations and Applications]]></title><description><![CDATA[Based in the First In First Out (FIFO) principle, the element added at the head of the list is the first to be removed. The terms "enqueue" and "dequeue," respectively, refer to the]]></description><link>http://direct.ecency.com/honouree/@trspusta/queue-data-structure-concepts-operations-and-applications</link><guid isPermaLink="true">http://direct.ecency.com/honouree/@trspusta/queue-data-structure-concepts-operations-and-applications</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[trspusta]]></dc:creator><pubDate>Wed, 08 Nov 2023 04:49:39 GMT</pubDate><enclosure url="https://i.ecency.com/p/S5Eokt4BcQdk7EHeT1aYjzebg2hC7hkthT45eBZopU4usaopboir56rF15bYRNZ96eysJwQ?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Introduction to Queue ]]></title><description><![CDATA[Introduction Queues are a fundamental data structure in computer science and programming. They follow the "first-in, first-out" (FIFO) principle, where the first element added to the queue is]]></description><link>http://direct.ecency.com/honouree/@jacfloresca07/introduction-to-queue</link><guid isPermaLink="true">http://direct.ecency.com/honouree/@jacfloresca07/introduction-to-queue</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[jacfloresca07]]></dc:creator><pubDate>Wed, 08 Nov 2023 02:55:30 GMT</pubDate><enclosure url="https://i.ecency.com/p/99pyU5Ga1kwrVs4xNb3c2ajEe5iDSaSF3ZGSFFME1GmHuWQNuPScur8V5yTcCrRFJPjvvoVKvA2E7LvK5cEY85WcbYUvPFNaC19vycipEfv9upnYimPTYNVRmrKbTgmxCW?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Exploring the Power of Queues: FIFO in Action with Java Examples]]></title><description><![CDATA[Queues, the unsung heroes of data structures, provide a robust solution for managing elements following the First-In-First-Out (FIFO) principle. From processing network packets to scheduling processes,]]></description><link>http://direct.ecency.com/honouree/@missaquila/exploring-the-power-of-queues-fifo-in-action-with-java-examples</link><guid isPermaLink="true">http://direct.ecency.com/honouree/@missaquila/exploring-the-power-of-queues-fifo-in-action-with-java-examples</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[missaquila]]></dc:creator><pubDate>Mon, 06 Nov 2023 06:47:00 GMT</pubDate><enclosure url="https://i.ecency.com/p/X37EMQ9WSwsPJFnZGCBnMgnpNuY8BJkomvp5ysqZd5X1GwD2m9S2fV1NUzgW3gsCcD2PXdS78zZNBrBiYRic8yY2s9XJe4DiVL5EE?format=match&amp;mode=fit" length="0" type="false"/></item></channel></rss>