<?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 16:17:24 GMT</lastBuildDate><atom:link href="https://ecency.com/@beatricearapoc/rss" rel="self" type="application/rss+xml"/><item><title><![CDATA[Quick Sort: An Efficient Comparison-Based Sorting Algorithm]]></title><description><![CDATA[The quick sort algorithm is an efficient sorting algorithm that compares the elements. This sorting algorithm uses a "divide and conquer" method wherein there will be a chosen "pivot"]]></description><link>https://ecency.com/@beatricearapoc/quick-sort-an-efficient-comparison-based-sorting-algorithm</link><guid isPermaLink="true">https://ecency.com/@beatricearapoc/quick-sort-an-efficient-comparison-based-sorting-algorithm</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[beatricearapoc]]></dc:creator><pubDate>Fri, 24 Nov 2023 01:08:36 GMT</pubDate></item><item><title><![CDATA[A Non-Comparative Sorting Algorithm: Counting Sort]]></title><description><![CDATA[Counting sort is a non-comparative sorting algorithm that is efficient. In the counting sort algorithm, it counts the number of occurrences of every unique element in the array. These number of occurrences]]></description><link>https://ecency.com/@beatricearapoc/a-non-comparative-sorting-algorithm-counting-sort</link><guid isPermaLink="true">https://ecency.com/@beatricearapoc/a-non-comparative-sorting-algorithm-counting-sort</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[beatricearapoc]]></dc:creator><pubDate>Tue, 21 Nov 2023 22:07:00 GMT</pubDate><enclosure url="https://i.ecency.com/p/4i88GgaV8qiFkxbnGCXnHPUK3daVLCQA4oDc4iy3ZcU6PrpJtAZRLuYwVdPn9tfh8DyrUEAMFYiGkkqawFgpYeajoLZYeMPxjL1xT7WSfsGKkvPQsSG63pPNJz?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[How the Selection Sort Algorithm Works]]></title><description><![CDATA[Similar to the bubble sort and insertion sort algorithms, the selection sort algorithm is a comparison-based sorting algorithm. The selection sort algorithm divides the array or list into two portions:]]></description><link>https://ecency.com/@beatricearapoc/how</link><guid isPermaLink="true">https://ecency.com/@beatricearapoc/how</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[beatricearapoc]]></dc:creator><pubDate>Fri, 17 Nov 2023 02:00:33 GMT</pubDate><enclosure url="https://i.ecency.com/p/HNWT6DgoBc1692QWn5trsLBYecSp3jKD1kzdmSDBq4pXFqjPgRadkQa7w3Df1wEqVyhokf3PVK4dkP3gimtorAUA84qR7KHDewSpKyKiR5uDQ5nngh939ubVqan?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Bubble Sort: A Comparison-Based Sorting Algorithm]]></title><description><![CDATA[One of the comparison - based sorting algorithms is the Bubble Sort. Basically, in bubble sort, it compares two adjacent elements. Once compared, the bubble sort algorithm will sort them if they are in]]></description><link>https://ecency.com/@beatricearapoc/bubble-sort-a-comparison-based-sorting-algorithm</link><guid isPermaLink="true">https://ecency.com/@beatricearapoc/bubble-sort-a-comparison-based-sorting-algorithm</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[beatricearapoc]]></dc:creator><pubDate>Tue, 14 Nov 2023 20:29:48 GMT</pubDate><enclosure url="https://i.ecency.com/p/qjrE4yyfw5pJD9LKQ1BG3NbSyKTowh8wnMyt99aJ7r6xGLT9snykJP99ou83AyUcz4w7bbrqyYSKa1oxHas1hkChcByX5HP5Bdn7hm6d9oJPhetGWb1uXoJe?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Introduction to the Heap: A Binary Tree-Based Data Structure]]></title><description><![CDATA[Heap is a binary tree-based data structure that is utilized to retrieve the maximum or minimum element in a collection of data based on the type of heap used. As this is a tree data structure, there will]]></description><link>https://ecency.com/@beatricearapoc/introduction-to-the-heap-a-binary-tree-based-data-structure</link><guid isPermaLink="true">https://ecency.com/@beatricearapoc/introduction-to-the-heap-a-binary-tree-based-data-structure</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[beatricearapoc]]></dc:creator><pubDate>Thu, 09 Nov 2023 21:44:03 GMT</pubDate><enclosure url="https://i.ecency.com/p/99pyU5Ga1kwr5Xg46gnE3BrdGQcYkevrMfGqYdeQrwjtp9D1eR96Afiv3ZQRjcTy5T57s6WaeeJk5gs2sQdbwd4ujh12xyrBEVBRmVAHX67iwpqK9UdYH2Sc2935CFZwqp?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Another Type of Linear Data Structure: Queues]]></title><description><![CDATA[One of the linear data structures in Java is the Queues. Queues follow the FIFO principle or the First In and First Out, unlike another linear data structure called stacks, which follow the LIFO principle]]></description><link>https://ecency.com/@beatricearapoc/another-type-of-linear-data-structure-queues</link><guid isPermaLink="true">https://ecency.com/@beatricearapoc/another-type-of-linear-data-structure-queues</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[beatricearapoc]]></dc:creator><pubDate>Tue, 07 Nov 2023 21:44:54 GMT</pubDate><enclosure url="https://i.ecency.com/p/C3TZR1g81UNbFzApDTmvFatkwuDREJFVGiTUu9HZF1Ug16N9ieh4x7Jtr61o7JDd61EgDjeoShEwR9wvgzrwCgU1MNJCAGv6Vd5BuMHLq9SgZxc6UDyENhU?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Dynamic Storing of Elements through Linked Lists]]></title><description><![CDATA[One more way to store elements of data is through linked lists. Linked lists are linear data structures that consist of nodes. The nodes in these linked lists have elements and references to the next node.]]></description><link>https://ecency.com/@beatricearapoc/dynamic-storing-of-elements-through-linked-lists</link><guid isPermaLink="true">https://ecency.com/@beatricearapoc/dynamic-storing-of-elements-through-linked-lists</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[beatricearapoc]]></dc:creator><pubDate>Mon, 16 Oct 2023 06:31:51 GMT</pubDate><enclosure url="https://i.ecency.com/p/Zskj9C56UonZ32EJw6nMctrTQ6kTQ3swaDmbMFu9VCgYc3JqeHfdJtxRwXfCcWq2Gkk1WeveUg2LEZJ3dYXSYRvDmpw5cFRi7TAnThTob5ccUPNmRxza?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Nodes as Building Blocks for other Data Structures]]></title><description><![CDATA[Nodes are one of the data structures that act as containers of data. They can serve as building blocks or the basis by providing the means of establishing relationships between the elements in the node.]]></description><link>https://ecency.com/@beatricearapoc/nodes-as-fundame</link><guid isPermaLink="true">https://ecency.com/@beatricearapoc/nodes-as-fundame</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[beatricearapoc]]></dc:creator><pubDate>Wed, 11 Oct 2023 06:45:33 GMT</pubDate><enclosure url="https://i.ecency.com/p/Zskj9C56UonZ32EJw6nMctrTQ6kTQ3swaDmbMFuAEwzkv6uKYENHXyDvTcvRXU4RZorqonsLzY8JEWUogfdiKKNxBT6B3xpyMyvwYNQc9915Q5S8UKh8?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Representing Collections of Data through Stacks]]></title><description><![CDATA[One of the ways of representing a collection of data is through stack. Stack is a data structure that follows the "LIFO" concept, which means last in, first out. This means that the recently]]></description><link>https://ecency.com/@beatricearapoc/representing-collections-of-data-through-stacks</link><guid isPermaLink="true">https://ecency.com/@beatricearapoc/representing-collections-of-data-through-stacks</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[beatricearapoc]]></dc:creator><pubDate>Sun, 08 Oct 2023 12:42:33 GMT</pubDate><enclosure url="https://i.ecency.com/p/3jpR3paJ37V8XPrHkfZdMtiM68fywBJwYt7EuhvxG7Ey4eXJFWu6q51eGnGBn4XRdDkaeifqJPAw3MCKDrFwRBTbvVyuiorGBeRUhmFvLLhXkgwChL2yHSMc3YudrvRNJ84n2?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Data Encryption: Encrypting and Decrypting Data in Java]]></title><description><![CDATA[Encrypting and decrypting data is something that I have always been curious about. As data is a valuable resource in today's society, it is essential to know how to protect it from people who do not have]]></description><link>https://ecency.com/@beatricearapoc/data-encryption-encrypting-and-decrypting-data-in-java</link><guid isPermaLink="true">https://ecency.com/@beatricearapoc/data-encryption-encrypting-and-decrypting-data-in-java</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[beatricearapoc]]></dc:creator><pubDate>Wed, 27 Sep 2023 06:53:09 GMT</pubDate><enclosure url="https://i.ecency.com/p/EEEoA8oLaAxtVnttk7BKQDWVRnh3rwiL2ZBsA8eAj1kLGw7MtDotaDase388gwugpPf33Li2ttk1nZFaFhCDLuG7AgWiDZvy81WSU8AsDUY58Y6a5KP56RobQqkC4Z5ojneDTSpKTiSNDc9BNFxZk?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Activity 4]]></title><description><![CDATA[The primary programming language for this subject, Data Structures and Algorithms, is Java. Classes started with downloading and installing an IDE called Visual Studio Code and the Java JDK package. This]]></description><link>https://ecency.com/@beatricearapoc/activity-4</link><guid isPermaLink="true">https://ecency.com/@beatricearapoc/activity-4</guid><category><![CDATA[honouree]]></category><dc:creator><![CDATA[beatricearapoc]]></dc:creator><pubDate>Wed, 06 Sep 2023 06:40:09 GMT</pubDate></item></channel></rss>