<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Quick Sort on Azriel Fidzlie</title><link>https://www.azriel.id/tags/quick-sort/</link><description>Recent content in Quick Sort on Azriel Fidzlie</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>© 2026 Azriel Fidzlie. All rights reserved.</copyright><lastBuildDate>Fri, 24 Apr 2026 05:02:50 +0700</lastBuildDate><atom:link href="https://www.azriel.id/tags/quick-sort/index.xml" rel="self" type="application/rss+xml"/><item><title>Algorithm and Logic #08: Divide and Conquer Method</title><link>https://www.azriel.id/study/programming/algorithm-and-logic/divide-and-conquer-method/</link><pubDate>Fri, 24 Apr 2026 05:02:50 +0700</pubDate><guid>https://www.azriel.id/study/programming/algorithm-and-logic/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-and-logic/divide-and-conquer-method/featured.svg"/></item></channel></rss>