<?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>Algorithms on ToiDB</title>
    <link>https://www.toidang.xyz/tags/algorithms/</link>
    <description>Recent content in 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/algorithms/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>What is CRC32 Checksum?</title>
      <link>https://www.toidang.xyz/posts/2024/12/10/what-is-crc32-checksum/</link>
      <pubDate>Tue, 10 Dec 2024 13:00:00 +0000</pubDate>
      <guid>https://www.toidang.xyz/posts/2024/12/10/what-is-crc32-checksum/</guid>
      <description>CRC32 is a checksum algorithm that is used to detect errors in data transmission. In this article, we will explore the basics of CRC32, how it works, and some common applications.</description>
    </item>
    <item>
      <title>Checksum Algorithms: Importance of Security and Common Vulnerabilities</title>
      <link>https://www.toidang.xyz/posts/2024/12/09/checksum-algorithms-importance-of-security-and-common-vulnerabilities/</link>
      <pubDate>Mon, 09 Dec 2024 13:00:00 +0000</pubDate>
      <guid>https://www.toidang.xyz/posts/2024/12/09/checksum-algorithms-importance-of-security-and-common-vulnerabilities/</guid>
      <description>Checksum algorithms are used to detect errors in data transmission and storage. In this article, we will explore the importance of security in checksum algorithms and some common security vulnerabilities.</description>
    </item>
    <item>
      <title>R-tree vs. Quadtree: A Comparison</title>
      <link>https://www.toidang.xyz/posts/2024/08/27/r-tree-vs.-quadtree-a-comparison/</link>
      <pubDate>Tue, 27 Aug 2024 15:00:00 +0000</pubDate>
      <guid>https://www.toidang.xyz/posts/2024/08/27/r-tree-vs.-quadtree-a-comparison/</guid>
      <description>R-trees and quadtrees are tree data structures used to represent multi-dimensional spatial data. In this article, we will compare the two data structures, explore their differences, and discuss their common applications.</description>
    </item>
    <item>
      <title>What is Quadtree?</title>
      <link>https://www.toidang.xyz/posts/2024/08/27/what-is-quadtree/</link>
      <pubDate>Tue, 27 Aug 2024 14:00:00 +0000</pubDate>
      <guid>https://www.toidang.xyz/posts/2024/08/27/what-is-quadtree/</guid>
      <description>A quadtree is a tree data structure that is used to represent a two-dimensional space. In this article, we will explore the basics of quadtree, how they work, and some common applications.</description>
    </item>
    <item>
      <title>What is R-Tree?</title>
      <link>https://www.toidang.xyz/posts/2024/08/27/what-is-r-tree/</link>
      <pubDate>Tue, 27 Aug 2024 13:00:00 +0000</pubDate>
      <guid>https://www.toidang.xyz/posts/2024/08/27/what-is-r-tree/</guid>
      <description>An R-tree is a tree data structure that is used to represent multi-dimensional spatial data. In this article, we will explore the basics of R-tree, how they work, and some common applications.</description>
    </item>
    <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>Linked List Algorithms in Ruby</title>
      <link>https://www.toidang.xyz/posts/2024/07/13/linked-list-algorithms-in-ruby/</link>
      <pubDate>Sat, 13 Jul 2024 14:15:00 +0000</pubDate>
      <guid>https://www.toidang.xyz/posts/2024/07/13/linked-list-algorithms-in-ruby/</guid>
      <description>Learn about linked list algorithms in Ruby, including linked list traversal, insertion, deletion, and reversal, with examples and comparisons of their performance.</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>
    <item>
      <title>Greedy Algorithms in Ruby</title>
      <link>https://www.toidang.xyz/posts/2024/07/13/greedy-algorithms-in-ruby/</link>
      <pubDate>Sat, 13 Jul 2024 09:00:00 +0000</pubDate>
      <guid>https://www.toidang.xyz/posts/2024/07/13/greedy-algorithms-in-ruby/</guid>
      <description>Learn about greedy algorithms in Ruby, including the greedy algorithm paradigm, examples of greedy algorithms, and their applications in solving optimization problems.</description>
    </item>
    <item>
      <title>Graph Algorithms in Ruby</title>
      <link>https://www.toidang.xyz/posts/2024/07/13/graph-algorithms-in-ruby/</link>
      <pubDate>Sat, 13 Jul 2024 08:00:00 +0000</pubDate>
      <guid>https://www.toidang.xyz/posts/2024/07/13/graph-algorithms-in-ruby/</guid>
      <description>Learn about graph algorithms in Ruby, including depth-first search (DFS), breadth-first search (BFS), Dijkstra&amp;rsquo;s algorithm, and A* search, with examples and comparisons of their performance.</description>
    </item>
    <item>
      <title>Tree Algorithms in Ruby</title>
      <link>https://www.toidang.xyz/posts/2024/07/13/tree-algorithms-in-ruby/</link>
      <pubDate>Sat, 13 Jul 2024 06:00:00 +0000</pubDate>
      <guid>https://www.toidang.xyz/posts/2024/07/13/tree-algorithms-in-ruby/</guid>
      <description>Learn about tree algorithms in Ruby, including tree traversal, binary search trees, and balanced trees, with examples and comparisons of their performance.</description>
    </item>
    <item>
      <title>Search Algorithms in Ruby</title>
      <link>https://www.toidang.xyz/posts/2024/07/13/search-algorithms-in-ruby/</link>
      <pubDate>Sat, 13 Jul 2024 05:00:00 +0000</pubDate>
      <guid>https://www.toidang.xyz/posts/2024/07/13/search-algorithms-in-ruby/</guid>
      <description>Learn about search algorithms in Ruby, including linear search, binary search, and interpolation search, with examples and comparisons of their performance.</description>
    </item>
    <item>
      <title>Sorting Algorithms in Ruby</title>
      <link>https://www.toidang.xyz/posts/2024/07/13/sorting-algorithms-in-ruby/</link>
      <pubDate>Sat, 13 Jul 2024 04:00:00 +0000</pubDate>
      <guid>https://www.toidang.xyz/posts/2024/07/13/sorting-algorithms-in-ruby/</guid>
      <description>Learn about sorting algorithms in Ruby, including bubble sort, selection sort, insertion sort, quick sort, and merge sort, with examples and comparisons of their performance.</description>
    </item>
  </channel>
</rss>
