<?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>Sun, 20 Sep 2026 20:07:52 GMT</lastBuildDate><atom:link href="https://ecency.com/@robertbite/rss" rel="self" type="application/rss+xml"/><item><title><![CDATA[The uses of insertion sort]]></title><description><![CDATA[Insertion Sort is a simple sorting algorithm that builds the final sorted array one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or]]></description><link>https://ecency.com/@robertbite/the-uses-of-insertion-sor</link><guid isPermaLink="true">https://ecency.com/@robertbite/the-uses-of-insertion-sor</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[robertbite]]></dc:creator><pubDate>Wed, 15 Nov 2023 06:11:00 GMT</pubDate></item><item><title><![CDATA[Bubble sorting made easy]]></title><description><![CDATA[Sorting is a fundamental operation in computer science, and there are various algorithms designed to efficiently arrange elements in a specific order. One such simple yet widely used sorting algorithm]]></description><link>https://ecency.com/@robertbite/bubble-sorting-made-easy</link><guid isPermaLink="true">https://ecency.com/@robertbite/bubble-sorting-made-easy</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[robertbite]]></dc:creator><pubDate>Mon, 13 Nov 2023 06:52:39 GMT</pubDate></item><item><title><![CDATA[Exploring Binary Search Trees and Efficient Tree Traversal]]></title><description><![CDATA[Binary Search Trees (BSTs) are fundamental data structures in computer science, renowned for their ability to facilitate efficient searching, insertion, and deletion operations. In this article, we will]]></description><link>https://ecency.com/@robertbite/exploring-binary-search-trees-and-efficient-tree-traversal</link><guid isPermaLink="true">https://ecency.com/@robertbite/exploring-binary-search-trees-and-efficient-tree-traversal</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[robertbite]]></dc:creator><pubDate>Mon, 13 Nov 2023 05:31:42 GMT</pubDate></item><item><title><![CDATA[Demystifying the Java Heap]]></title><description><![CDATA[Java, a powerful and versatile programming language, is known for its robust memory management capabilities. Central to this memory management is the concept of the Java Heap. In this article, we will]]></description><link>https://ecency.com/@robertbite/demystifying-the-java-heap</link><guid isPermaLink="true">https://ecency.com/@robertbite/demystifying-the-java-heap</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[robertbite]]></dc:creator><pubDate>Fri, 10 Nov 2023 03:34:45 GMT</pubDate></item><item><title><![CDATA[Mastering Queues]]></title><description><![CDATA[Queues are a fundamental data structure in computer science that follow the First-In-First-Out (FIFO) principle. In Java, the Queue interface is part of the java.util package and provides a versatile way]]></description><link>https://ecency.com/@robertbite/mastering-queues-in-java</link><guid isPermaLink="true">https://ecency.com/@robertbite/mastering-queues-in-java</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[robertbite]]></dc:creator><pubDate>Fri, 10 Nov 2023 03:27:12 GMT</pubDate></item><item><title><![CDATA[The power of a list ]]></title><description><![CDATA[In this lesson we had on linked lists i learned that a linked list is a data structure that consists of a sequence of elements where each element points to the next one, forming a chain-like structure.]]></description><link>https://ecency.com/@robertbite/the-power-of-a-list</link><guid isPermaLink="true">https://ecency.com/@robertbite/the-power-of-a-list</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[robertbite]]></dc:creator><pubDate>Mon, 16 Oct 2023 06:15:45 GMT</pubDate></item><item><title><![CDATA[Java Nodes Unveiled ]]></title><description><![CDATA[In the context of computer science, a node is a fundamental unit in a data structure. It typically contains two main components: data and references (or pointers). The data component stores the actual]]></description><link>https://ecency.com/@robertbite/java-nodes-unveiled</link><guid isPermaLink="true">https://ecency.com/@robertbite/java-nodes-unveiled</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[robertbite]]></dc:creator><pubDate>Wed, 11 Oct 2023 05:58:18 GMT</pubDate></item><item><title><![CDATA[Mastering the stack]]></title><description><![CDATA[In the world of programming, data structures play a pivotal role in efficiently storing and managing data. One such fundamental data structure is the stack. A stack is a linear data structure that follows]]></description><link>https://ecency.com/@robertbite/mastering-the-stack</link><guid isPermaLink="true">https://ecency.com/@robertbite/mastering-the-stack</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[robertbite]]></dc:creator><pubDate>Mon, 09 Oct 2023 05:20:15 GMT</pubDate></item><item><title><![CDATA[Ascending and Decending]]></title><description><![CDATA[Sorting an array means that we could organize things or make things go from decending to ascending order. This has helped many people to organize things that dont look in order. Unlike the encryption method]]></description><link>https://ecency.com/@robertbite/ascending-and-decendin</link><guid isPermaLink="true">https://ecency.com/@robertbite/ascending-and-decendin</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[robertbite]]></dc:creator><pubDate>Fri, 29 Sep 2023 03:31:09 GMT</pubDate></item><item><title><![CDATA[Secret messeges]]></title><description><![CDATA[In the lesson we learned that there are some words that could be expressed un many ways. They are called arrays and string, this two come together to form a code of words that may seem random but with]]></description><link>https://ecency.com/@robertbite/secret-messeges</link><guid isPermaLink="true">https://ecency.com/@robertbite/secret-messeges</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[robertbite]]></dc:creator><pubDate>Wed, 27 Sep 2023 06:55:18 GMT</pubDate></item></channel></rss>