<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Algorithm Logic on Azriel Fidzlie</title><link>https://www.azriel.id/categories/algorithm-logic/</link><description>Recent content in Algorithm Logic on Azriel Fidzlie</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>© 2026 Azriel Fidzlie. All rights reserved.</copyright><lastBuildDate>Tue, 28 Apr 2026 05:02:50 +0700</lastBuildDate><atom:link href="https://www.azriel.id/categories/algorithm-logic/index.xml" rel="self" type="application/rss+xml"/><item><title>Logic and Algorithm #12: Problems and Graph Models in Greedy Method</title><link>https://www.azriel.id/study/programming/algorithm-logic/12-problems-and-graph-models-in-greedy-method/</link><pubDate>Tue, 28 Apr 2026 05:02:50 +0700</pubDate><guid>https://www.azriel.id/study/programming/algorithm-logic/12-problems-and-graph-models-in-greedy-method/</guid><description>Graph is a branch of mathematics that can be applied in everyday life, graph theory can solve many existing problems (Ramadhan et al., 2018).</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://www.azriel.id/study/programming/algorithm-logic/12-problems-and-graph-models-in-greedy-method/featured.png"/></item><item><title>Logic and Algorithm #11: Greedy Method</title><link>https://www.azriel.id/study/programming/algorithm-logic/11-greedy-method/</link><pubDate>Mon, 27 Apr 2026 05:02:50 +0700</pubDate><guid>https://www.azriel.id/study/programming/algorithm-logic/11-greedy-method/</guid><description>Greedy is taken from English meaning greedy, avaricious, stingy, miserly.</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://www.azriel.id/study/programming/algorithm-logic/11-greedy-method/featured.png"/></item><item><title>Logic and Algorithms #10: Searching Techniques and Introduction to Algorithm Analysis</title><link>https://www.azriel.id/study/programming/algorithm-logic/10-searching-techniques-and-introduction-to-algorithm-analysis/</link><pubDate>Sun, 26 Apr 2026 05:02:50 +0700</pubDate><guid>https://www.azriel.id/study/programming/algorithm-logic/10-searching-techniques-and-introduction-to-algorithm-analysis/</guid><description>Techniques for picking and selecting an element from several existing elements.</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://www.azriel.id/study/programming/algorithm-logic/10-searching-techniques-and-introduction-to-algorithm-analysis/featured.png"/></item><item><title>Logic and Algorithms #09: Sorting Methods</title><link>https://www.azriel.id/study/programming/algorithm-logic/09-sorting-methods/</link><pubDate>Sat, 25 Apr 2026 05:02:50 +0700</pubDate><guid>https://www.azriel.id/study/programming/algorithm-logic/09-sorting-methods/</guid><description>The process of arranging a series of data into a certain order or arrangement. The sorted data can be numeric data, character data, or string data (Sitorus, 2015).</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://www.azriel.id/study/programming/algorithm-logic/09-sorting-methods/featured.png"/></item><item><title>Logic and Algorithms #08: Divide and Conquer Method</title><link>https://www.azriel.id/study/programming/algorithm-logic/08-divide-and-conquer-method/</link><pubDate>Fri, 24 Apr 2026 05:02:50 +0700</pubDate><guid>https://www.azriel.id/study/programming/algorithm-logic/08-divide-and-conquer-method/</guid><description>The Divide and Conquer method is a problem-solving approach that divides a problem into smaller parts, solves each part, and then combines the results.</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://www.azriel.id/study/programming/algorithm-logic/08-divide-and-conquer-method/featured.png"/></item><item><title>Logic and Algorithms #07: Array</title><link>https://www.azriel.id/study/programming/algorithm-logic/07-array/</link><pubDate>Thu, 23 Apr 2026 05:02:50 +0700</pubDate><guid>https://www.azriel.id/study/programming/algorithm-logic/07-array/</guid><description>An array is a data structure used to store multiple values in a single variable.</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://www.azriel.id/study/programming/algorithm-logic/07-array/featured.png"/></item><item><title>Logic and Algorithms #06: Recursive Structures</title><link>https://www.azriel.id/study/programming/algorithm-logic/06-recursive-structures/</link><pubDate>Wed, 22 Apr 2026 05:02:50 +0700</pubDate><guid>https://www.azriel.id/study/programming/algorithm-logic/06-recursive-structures/</guid><description>A recursive structure is a concept where a function calls itself to solve a problem.</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://www.azriel.id/study/programming/algorithm-logic/06-recursive-structures/featured.png"/></item><item><title>Logic and Algorithms #05: Looping</title><link>https://www.azriel.id/study/programming/algorithm-logic/05-looping/</link><pubDate>Tue, 21 Apr 2026 05:02:50 +0700</pubDate><guid>https://www.azriel.id/study/programming/algorithm-logic/05-looping/</guid><description>Looping is a control structure that allows a program to repeat the execution of a block of code as long as a certain condition is met.</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://www.azriel.id/study/programming/algorithm-logic/05-looping/featured.png"/></item><item><title>Logic and Algorithms #04: Branching</title><link>https://www.azriel.id/study/programming/algorithm-logic/04-branching/</link><pubDate>Mon, 20 Apr 2026 05:02:50 +0700</pubDate><guid>https://www.azriel.id/study/programming/algorithm-logic/04-branching/</guid><description>Branching is a control structure that allows a program to make decisions based on certain conditions.</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://www.azriel.id/study/programming/algorithm-logic/04-branching/featured.png"/></item><item><title>Logic and Algorithm #03: Flowchart</title><link>https://www.azriel.id/study/programming/algorithm-logic/03-flowchart/</link><pubDate>Sun, 19 Apr 2026 05:02:50 +0700</pubDate><guid>https://www.azriel.id/study/programming/algorithm-logic/03-flowchart/</guid><description>A flowchart is a graphical representation of an algorithm that uses symbols to show the steps in problem-solving.</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://www.azriel.id/study/programming/algorithm-logic/03-flowchart/featured.png"/></item><item><title>Logic and Algorithm #02: Algorithm Concepts and Data Concepts</title><link>https://www.azriel.id/study/programming/algorithm-logic/02-algorithm-concepts-and-data-concepts/</link><pubDate>Sat, 18 Apr 2026 05:02:50 +0700</pubDate><guid>https://www.azriel.id/study/programming/algorithm-logic/02-algorithm-concepts-and-data-concepts/</guid><description>The Concept of Algorithm is an effort with a sequence of operations arranged logically and systematically to solve a problem to produce a specific output, while Data Type is an attribute related to data that will tell the computer system.</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://www.azriel.id/study/programming/algorithm-logic/02-algorithm-concepts-and-data-concepts/featured.png"/></item><item><title>Logic and Algorithms #01: Basic Concepts</title><link>https://www.azriel.id/study/programming/algorithm-logic/01-basic-concepts/</link><pubDate>Fri, 17 Apr 2026 05:02:50 +0700</pubDate><guid>https://www.azriel.id/study/programming/algorithm-logic/01-basic-concepts/</guid><description>A complete tutorial on logic and algorithms for beginners that will help you understand the basics of logic and algorithms as well as how to create problem solutions.</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://www.azriel.id/study/programming/algorithm-logic/01-basic-concepts/featured.png"/></item></channel></rss>