<?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>Mergesort on kidoni.dev</title>
    <link>https://kidoni.dev/tags/mergesort/</link>
    <description>Recent content in Mergesort on kidoni.dev</description>
    <generator>Hugo -- 0.157.0</generator>
    <language>en-US</language>
    <lastBuildDate>Thu, 21 Jan 2021 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://kidoni.dev/tags/mergesort/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Java&#39;s fork-join framework</title>
      <link>https://kidoni.dev/posts/java-fork-join-framework/</link>
      <pubDate>Thu, 21 Jan 2021 00:00:00 +0000</pubDate>
      <guid>https://kidoni.dev/posts/java-fork-join-framework/</guid>
      <description>&lt;p&gt;Since Java 7, the JDK includes a set of classes implementing a fork-join
pattern. This is an approach decomposing work into multiple tasks that
can be executed in parallel. Java provides &lt;code&gt;ForkJoinPool&lt;/code&gt; and &lt;code&gt;ForkJoinTask&lt;/code&gt; as
the two primary classes implementing the approach. This post will cover
an example of using these, by converting a Mergesort implementation from
a recursive implementation to one using fork-join.&lt;/p&gt;
&lt;p&gt;Mergesort is a classic divide-and-conquer approach to sorting. The data
to be sorted are split into two halves, and those halves each are split
into two until the data can no longer be split. Then the resulting
arrays are merged and sorted.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
