<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>Divide and Conquer Algorithms on ToiDB</title>
    <link>https://www.toidang.xyz/tags/divide-and-conquer-algorithms/</link>
    <description>Recent content in Divide and Conquer Algorithms on ToiDB</description>
    <image>
      <title>ToiDB</title>
      <url>https://www.toidang.xyz/web/static/me-512x512.png</url>
      <link>https://www.toidang.xyz/web/static/me-512x512.png</link>
    </image>
    <generator>Hugo</generator>
    <language>en</language>
    <lastBuildDate>Sun, 09 Feb 2025 13:50:31 +0700</lastBuildDate>
    <atom:link href="https://www.toidang.xyz/tags/divide-and-conquer-algorithms/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Some Algorithms Based on Divide and Conquer Principles in Ruby - Part 3</title>
      <link>https://www.toidang.xyz/posts/2024/07/13/some-algorithms-based-on-divide-and-conquer-principles-in-ruby-part-3/</link>
      <pubDate>Sat, 13 Jul 2024 15:00:00 +0000</pubDate>
      <guid>https://www.toidang.xyz/posts/2024/07/13/some-algorithms-based-on-divide-and-conquer-principles-in-ruby-part-3/</guid>
      <description>Explore algorithms based on divide and conquer principles in Ruby, including Kruskal&amp;rsquo;s algorithm for minimum spanning tree, line intersection, and parallel algorithms for connected components, with examples and implementations.</description>
    </item>
    <item>
      <title>Some Algorithms Based on Divide and Conquer Principles in Ruby - Part 2</title>
      <link>https://www.toidang.xyz/posts/2024/07/13/some-algorithms-based-on-divide-and-conquer-principles-in-ruby-part-2/</link>
      <pubDate>Sat, 13 Jul 2024 14:45:00 +0000</pubDate>
      <guid>https://www.toidang.xyz/posts/2024/07/13/some-algorithms-based-on-divide-and-conquer-principles-in-ruby-part-2/</guid>
      <description>Explore some algorithms based on divide and conquer principles in Ruby, including the Master Theorem, Fast Walsh-Hadamard Transform, Counting Inversions, Skyline Problem, Maximum Subarray Problem, Sparse Table, Planar Point Location, Maximum Flow Problem, Dynamic Programming Optimization, and Discrete Fourier Transform.</description>
    </item>
    <item>
      <title>Some Algorithms Based on Divide and Conquer Principles in Ruby - Part 1</title>
      <link>https://www.toidang.xyz/posts/2024/07/13/some-algorithms-based-on-divide-and-conquer-principles-in-ruby-part-1/</link>
      <pubDate>Sat, 13 Jul 2024 14:30:00 +0000</pubDate>
      <guid>https://www.toidang.xyz/posts/2024/07/13/some-algorithms-based-on-divide-and-conquer-principles-in-ruby-part-1/</guid>
      <description>Some example of divide and conquer algorithms in Ruby, including binary Karatsuba Algorithm, Fast Fourier Transform (FFT), Closest Pair of Points, Convex Hull, Optimal Binary Search Tree, VLSI Layout, Tower of Hanoi, Multipoint Polynomial Evaluation and Interpolation, Medians and Order Statistics, Ternary Search.</description>
    </item>
    <item>
      <title>Divide and Conquer Algorithms</title>
      <link>https://www.toidang.xyz/posts/2024/07/13/divide-and-conquer-algorithms/</link>
      <pubDate>Sat, 13 Jul 2024 11:30:00 +0000</pubDate>
      <guid>https://www.toidang.xyz/posts/2024/07/13/divide-and-conquer-algorithms/</guid>
      <description>Learn about divide and conquer algorithms in Ruby, including binary search, merge sort and quick sort, with examples and comparisons of their performance.</description>
    </item>
  </channel>
</rss>
