<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Algorithms on Andrew Walsh</title><link>http://awalsh128.com/tags/algorithms/</link><description>Recent content in Algorithms on Andrew Walsh</description><generator>Hugo -- gohugo.io</generator><language>en-US</language><copyright>© 2026 Andrew Walsh</copyright><lastBuildDate>Wed, 03 Oct 2012 13:45:24 -0700</lastBuildDate><atom:link href="http://awalsh128.com/tags/algorithms/feed.xml" rel="self" type="application/rss+xml"/><item><title>Understanding compression and Huffman Coding.</title><link>http://awalsh128.com/understanding-compression-and-huffman/</link><pubDate>Thu, 20 Sep 2012 00:00:00 -0700</pubDate><guid>http://awalsh128.com/understanding-compression-and-huffman/</guid><description>&lt;h3 class="relative group"&gt;Definitions&#10; &lt;div id="definitions" class="anchor"&gt;&lt;/div&gt;&#10; &#10; &lt;span&#10; class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"&gt;&#10; &lt;a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#definitions" aria-label="Anchor"&gt;#&lt;/a&gt;&#10; &lt;/span&gt;&#10; &#10;&lt;/h3&gt;&#10;&lt;p&gt;In a lot of texts regarding compression you will run across various&#10;conventions of syntax to describe the coding of data. Much of them are&#10;used in fields like &lt;a href="http://en.wikipedia.org/wiki/Automata_theory" target="_blank" rel="noreferrer"&gt;automata&#10;theory&lt;/a&gt;, group theory and&#10;statistics. Although, the field of &lt;a href="http://en.wikipedia.org/wiki/Coding_theory" target="_blank" rel="noreferrer"&gt;coding&#10;theory&lt;/a&gt; itself has &lt;a href="http://en.wikipedia.org/wiki/Timeline_of_information_theory" target="_blank" rel="noreferrer"&gt;a long&#10;and rich&#10;history&lt;/a&gt; in&#10;the 20st century; much of the terminology is borrowed from fields that&#10;gave rise to it.&lt;/p&gt;</description></item><item><title>Detecting cycles in decimal digits and lists.</title><link>http://awalsh128.com/detecting-cycles-in-decimal-digits-and/</link><pubDate>Sun, 16 Oct 2011 00:00:00 -0700</pubDate><guid>http://awalsh128.com/detecting-cycles-in-decimal-digits-and/</guid><description>&lt;p&gt;I was recently working on solving &lt;a href="http://projecteuler.net/problem=64" target="_blank" rel="noreferrer"&gt;problem 64 for project&#10;Euler&lt;/a&gt; and one of the needed&#10;algorithms was a detection of cycles in a list. This routine works for&#10;detecting cycles in lists of cardinality greater than 2.&lt;br&gt;&#10;\&lt;/p&gt;</description></item><item><title>Pseudo random proportional scheduling in games.</title><link>http://awalsh128.com/pseudo-random-proportional-scheduling/</link><pubDate>Fri, 02 Sep 2011 00:00:00 -0700</pubDate><guid>http://awalsh128.com/pseudo-random-proportional-scheduling/</guid><description>&lt;p&gt;I have been working on a game where enemy characters must select a&#10;target seemingly at random but such that the distribution of selected&#10;targets is balanced. Initially I had come up with a randomization&#10;algorithm with weighted values for each target but this became&#10;cumbersome and much too complex.&lt;br&gt;&#10;&lt;br&gt;&#10;Then I remembered the scheduling algorithms from my Operating Systems&#10;class. In particular, the &lt;a href="http://en.wikipedia.org/wiki/Lottery_scheduling" target="_blank" rel="noreferrer"&gt;lottery scheduling&#10;algorithm&lt;/a&gt;.&lt;br&gt;&#10;\&lt;/p&gt;</description></item></channel></rss>