<?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 13:48:41 GMT</lastBuildDate><atom:link href="https://ecency.com/@trspusta/rss" rel="self" type="application/rss+xml"/><item><title><![CDATA[Bubble Sort: A Student's Perspective]]></title><description><![CDATA[A straightforward sorting algorithm called bubble sort works by repeatedly switching adjacent elements out of order. It is inappropriate for large data sets because of its high average and worst-case time]]></description><link>https://ecency.com/@trspusta/bubble-sort</link><guid isPermaLink="true">https://ecency.com/@trspusta/bubble-sort</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[trspusta]]></dc:creator><pubDate>Wed, 15 Nov 2023 06:21:45 GMT</pubDate><enclosure url="https://i.ecency.com/p/S5Eokt4BcQdk7EHeT1aYjzebg2hC7hkthT45e3X8jYuKYXPWUWo1tpzsLJgLBavpvRejJLN?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Binary Search Tree Operations and Binary Tree Traversal: My perspective]]></title><description><![CDATA[One kind of tree data structure called a Binary Search Tree (BST) is used to store and arrange data so that insertion, deletion, and searching can be done quickly and effectively. Nodes, the building blocks]]></description><link>https://ecency.com/@trspusta/binary-search-tree-operations-and-binary-tree-traversal-my-perspec</link><guid isPermaLink="true">https://ecency.com/@trspusta/binary-search-tree-operations-and-binary-tree-traversal-my-perspec</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[trspusta]]></dc:creator><pubDate>Fri, 10 Nov 2023 03:47:45 GMT</pubDate><enclosure url="https://i.ecency.com/p/2dk2RRM2dZ8gPSQXD23TTBG1Ncttyvr2tFqsc2TU663EnfwtevVAB4ta8iDuNmZTHFWpUu5rr1kfpyJvhzkbaPg4ZFGC3JnVx3QxsFQsbLug4DmtkoZZhMghEhnmEqzFAMmcm1aQnnHruwhi4j5XPd3Lsjdj7JQv4pAmvH9MRM?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>https://ecency.com/@trspusta/queue-data-structure-concepts-operations-and-applications</link><guid isPermaLink="true">https://ecency.com/@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[Linked List: A summary]]></title><description><![CDATA[What is a Linked List? A linked list is a way of storing data in a sequence. It's like a chain where each link points to the next one. Each link contains two parts: the data and a reference to the following]]></description><link>https://ecency.com/@trspusta/linked-list-a-summary</link><guid isPermaLink="true">https://ecency.com/@trspusta/linked-list-a-summary</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[trspusta]]></dc:creator><pubDate>Mon, 16 Oct 2023 06:39:15 GMT</pubDate><enclosure url="https://i.ecency.com/p/S5Eokt4BcQdk7EHeT1aYjzebg2hC7hkthT45eBAfWnmxstbUfZuXqUuBdrUkQ1FH7WHdRHg?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Another Perspective of Nodes]]></title><description><![CDATA[Nodes are the fundamental building blocks of data structures, providing the organization and structure necessary for adequate data storage and retrieval. They represent distinct data structure components]]></description><link>https://ecency.com/@trspusta/another-perspective-of-nodes-a-compl</link><guid isPermaLink="true">https://ecency.com/@trspusta/another-perspective-of-nodes-a-compl</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[trspusta]]></dc:creator><pubDate>Wed, 11 Oct 2023 06:29:27 GMT</pubDate><enclosure url="https://i.ecency.com/p/S5Eokt4BcQdk7EHeT1aYjzebg2hC7hkthT45dum5SWueNBhuCgkKcSjcjaxjGAuhKgELnwp?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[An Overall Understanding of Stack]]></title><description><![CDATA[Stacks and arrays are two distinct data structures with different uses. A stack can, however, be implemented using an array. In this approach, the stack's elements are stored in an array, and a top pointer]]></description><link>https://ecency.com/@trspusta/an-overall-understanding-of-stack</link><guid isPermaLink="true">https://ecency.com/@trspusta/an-overall-understanding-of-stack</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[trspusta]]></dc:creator><pubDate>Mon, 02 Oct 2023 07:08:06 GMT</pubDate><enclosure url="https://i.ecency.com/p/S5Eokt4BcQdk7EHeT1aYjzebg2hC7hkthT45e6GRDKWfQffx6oy5ct12ng8tTXH62EZgzQv?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Java Arrays: Sorting Made Easy with Built-in Methods and Algorithms]]></title><description><![CDATA[A fundamental task in computer science and programming is sorting arrays. It entails setting up various items in a particular order, such as ascending or descending. Numerous algorithms and methods can]]></description><link>https://ecency.com/@trspusta/java-arrays-sorting-made-easy-with-built-in-methods-and-algorithms</link><guid isPermaLink="true">https://ecency.com/@trspusta/java-arrays-sorting-made-easy-with-built-in-methods-and-algorithms</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[trspusta]]></dc:creator><pubDate>Fri, 29 Sep 2023 03:15:57 GMT</pubDate><enclosure url="https://i.ecency.com/p/S5Eokt4BcQdk7EHeT1aYjzebg2hC7hkthT45eLMS9VxQ6tWTkmJHgxL4ADHWBP13hxhbu4z?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Data Encryption, Stacks and Arrays (In a Student's Perspective)]]></title><description><![CDATA[We need to understand stack because it uses the principle "last in, first out." rather than arrays that just replicate the concepts that I will be using today. What is the difference between]]></description><link>https://ecency.com/@trspusta/data-encryption-stacks-and-arrays-in-a-student-s-perspective</link><guid isPermaLink="true">https://ecency.com/@trspusta/data-encryption-stacks-and-arrays-in-a-student-s-perspective</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[trspusta]]></dc:creator><pubDate>Wed, 27 Sep 2023 06:51:30 GMT</pubDate><enclosure url="https://i.ecency.com/p/S5Eokt4BcQdk7EHeT1aYjzebg2hC7hkthT45e6GRDKWfQffx6oy5ct12ng8tTXH62EZgzQv?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[4-107 Activity 4 (Pusta)]]></title><description><![CDATA[What I obtain the most in this subject is the proper installation of the Java, JavaScript and VSS plugins which is seen in the two videos The requirements that I need for the Java SE 8 application and]]></description><link>https://ecency.com/@trspusta/4-107-activity-4-pusta</link><guid isPermaLink="true">https://ecency.com/@trspusta/4-107-activity-4-pusta</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[trspusta]]></dc:creator><pubDate>Wed, 06 Sep 2023 06:31:42 GMT</pubDate><enclosure url="https://i.ecency.com/p/S5Eokt4BcQdk7EHeT1aYjzebg2hC7hkthT45e36tw5ZPQ7oEgjSy4NBg64dUX3nuEhUM3PL?format=match&amp;mode=fit" length="0" type="false"/></item></channel></rss>