<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Permutations on Sulprobil</title>
    <link>https://www.sulprobil.de/tags/permutations/</link>
    <description>Recent content in Permutations on Sulprobil</description>
    <generator>Hugo</generator>
    <language>en</language>
    <lastBuildDate>Wed, 20 May 2026 04:36:00 +0100</lastBuildDate>
    <atom:link href="https://www.sulprobil.de/tags/permutations/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>QuickPerm (Excel / VBA)</title>
      <link>https://www.sulprobil.de/quickperm_en/</link>
      <pubDate>Wed, 20 May 2026 04:36:00 +0100</pubDate>
      <guid>https://www.sulprobil.de/quickperm_en/</guid>
      <description>&lt;h2 id=&#34;abstract&#34;&gt;Abstract&lt;/h2&gt;&#xA;&lt;p&gt;If you need to generate all permutations of an array&#xA;I suggest to use the algorithm (external link!) &lt;a href=&#34;https://www.quickperm.org&#34;&gt;Quickperm&lt;/a&gt;.&#xA;It is one of the most efficient permutation algorithms.&#xA;It is based on swaps of single array elements and inspired by Heap sort.&lt;/p&gt;&#xA;&lt;p&gt;The version presented here is the CountDown variant.&#xA;For the Excel / VBA implementation all indices were increased by one&#xA;so that arrays start with index 1.&lt;/p&gt;&#xA;&lt;h2 id=&#34;example&#34;&gt;Example&lt;/h2&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
