<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="https://www.snipit.org/public/rss2html.xsl"?>
<!-- Generated by: http://www.phpclasses.org/rsswriter $Revision: 1.7 $ -->
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:dc="http://purl.org/dc/elements/1.1/">
 <channel rdf:about="https://www.snipit.org/public/alan/rss_channel.php?catid=1763">
  <description/>
  <link>https://www.snipit.org/public/alan/viewchannel.php?catid=1763</link>
  <title>Snip!t channel - Alan Dix: Channels &gt; algorithms</title>
  <dc:date>2022-01-09T14:01:40Z</dc:date>
  <image rdf:resource="https://www.snipit.org/images/scissors.gif"/>
  <items>
   <rdf:Seq>
    <rdf:li rdf:resource="https://www.snipit.org/public/alan/viewsnip.php?id=1651014"/>
    <rdf:li rdf:resource="https://www.snipit.org/public/alan/viewsnip.php?id=1369933"/>
    <rdf:li rdf:resource="https://www.snipit.org/public/alan/viewsnip.php?id=1255931"/>
    <rdf:li rdf:resource="https://www.snipit.org/public/alan/viewsnip.php?id=694198"/>
    <rdf:li rdf:resource="https://www.snipit.org/public/alan/viewsnip.php?id=571191"/>
    <rdf:li rdf:resource="https://www.snipit.org/public/alan/viewsnip.php?id=434040"/>
    <rdf:li rdf:resource="https://www.snipit.org/public/alan/viewsnip.php?id=191236"/>
    <rdf:li rdf:resource="https://www.snipit.org/public/alan/viewsnip.php?id=191235"/>
    <rdf:li rdf:resource="https://www.snipit.org/public/alan/viewsnip.php?id=1766"/>
    <rdf:li rdf:resource="https://www.snipit.org/public/alan/viewsnip.php?id=1765"/>
    <rdf:li rdf:resource="https://www.snipit.org/public/alan/viewsnip.php?id=1764"/>
    <rdf:li rdf:resource="https://www.snipit.org/public/alan/viewsnip.php?id=1762"/>
   </rdf:Seq>
  </items>
 </channel>
 <image rdf:about="https://www.snipit.org/images/scissors.gif">
  <url>https://www.snipit.org/images/scissors.gif</url>
  <link>https://www.snipit.org/public/alan/viewchannel.php?catid=1763</link>
  <title>Snip!t logo</title>
  <description>Snip!t channel - Alan Dix: Channels &gt; algorithms</description>
 </image>
 <item rdf:about="https://www.snipit.org/public/alan/viewsnip.php?id=1651014">
  <description>THE assumption that Black people have a lower level of c...  than white people was, until recently, built into a form...  National Football League to settle head injury lawsuits.</description>
  <link>https://www.snipit.org/public/alan/viewsnip.php?id=1651014</link>
  <title>How medical tests have built-in discrimination against Black people | New Scientist</title>
  <dc:source>https://www.newscientist.com/article/mg25133434-100-how-medical-tests-have-built-in-discrimination-against-black-people/</dc:source>
  <dc:date>2022-01-09T14:01:40Z</dc:date>
 </item>
 <item rdf:about="https://www.snipit.org/public/alan/viewsnip.php?id=1369933">
  <description/>
  <link>https://www.snipit.org/public/alan/viewsnip.php?id=1369933</link>
  <title>The 10 Algorithms That Dominate Our World</title>
  <dc:source>http://io9.com/the-10-algorithms-that-dominate-our-world-1580110464</dc:source>
  <dc:date>2014-05-27T13:11:38Z</dc:date>
 </item>
 <item rdf:about="https://www.snipit.org/public/alan/viewsnip.php?id=1255931">
  <description>For a large range of practically useful cases, MIT resea...  to increase the speed of one of the most important algor...  information sciences.</description>
  <link>https://www.snipit.org/public/alan/viewsnip.php?id=1255931</link>
  <title>The faster-than-fast Fourier transform - MIT News Office</title>
  <dc:source>http://web.mit.edu/newsoffice/2012/faster-fourier-transforms-0118.html</dc:source>
  <dc:date>2013-12-14T10:27:03Z</dc:date>
 </item>
 <item rdf:about="https://www.snipit.org/public/alan/viewsnip.php?id=694198">
  <description>Canvas Visualizations of Sorting Algorithms canvas, java...  Willison, I was made aware of an old but interesting pos...  visualizing of sorting algorithms. Aldo Cortesi explains... &#10;He decided to make something better and ended up with so ...&#10;Anyway, I t</description>
  <link>https://www.snipit.org/public/alan/viewsnip.php?id=694198</link>
  <title>Canvas Visualizations of Sorting Algorithms - Nihilogic</title>
  <dc:source>http://blog.nihilogic.dk/2009/04/canvas-visualizations-of-sorting.html</dc:source>
  <dc:date>2012-01-31T13:32:38Z</dc:date>
 </item>
 <item rdf:about="https://www.snipit.org/public/alan/viewsnip.php?id=571191">
  <description>A complete list of all major algorithms (300), in any do...  to provide a ready to run program for each one, or a des...  algorithm. Programming languages include Java, JavaScrip...  either in direct form or generated from a Scriptol source.</description>
  <link>https://www.snipit.org/public/alan/viewsnip.php?id=571191</link>
  <title>List of Algorithms</title>
  <dc:source>http://www.scriptol.com/programming/list-algorithms.php#Compression</dc:source>
  <dc:date>2011-10-22T16:08:31Z</dc:date>
 </item>
 <item rdf:about="https://www.snipit.org/public/alan/viewsnip.php?id=434040">
  <description>You may well have seen many simulations of sorting algor...  show in novel ways how the algorithm works or perhaps do...  as well as it should. However I guarantee that you have ... &#10;Take one Central European folk dancing team, a small fol ...&#10;sortdance</description>
  <link>https://www.snipit.org/public/alan/viewsnip.php?id=434040</link>
  <title>Sorting algorithms as dances</title>
  <dc:source>http://www.i-programmer.info/news/150-training-a-education/2255-sorting-algorithms-as-dances.html</dc:source>
  <dc:date>2011-05-07T20:15:22Z</dc:date>
 </item>
 <item rdf:about="https://www.snipit.org/public/alan/viewsnip.php?id=191236">
  <description/>
  <link>https://www.snipit.org/public/alan/viewsnip.php?id=191236</link>
  <title>YouTube - Heap Sort</title>
  <dc:source>http://www.youtube.com/watch?v=WYII2Oau_VY&amp;feature=player_embedded</dc:source>
  <dc:date>2010-08-23T15:44:55Z</dc:date>
 </item>
 <item rdf:about="https://www.snipit.org/public/alan/viewsnip.php?id=191235">
  <description>Sorting algorithms: quite boring until you add sound effects&#10;Aug. 19, 2010 (5:55 pm) By: Matthew Humphries&#10;Anyone who has ever done a programming course or tried t ...&#10;The subject matter is fairly dry. Thankfully someone has ...&#10;... via Hacker News</description>
  <link>https://www.snipit.org/public/alan/viewsnip.php?id=191235</link>
  <title>Sorting algorithms: quite boring until you add sound effects | Geek.com</title>
  <dc:source>http://www.geek.com/articles/geek-cetera/sorting-algorithms-quite-boring-until-you-add-sound-effects-20100819/</dc:source>
  <dc:date>2010-08-23T15:40:30Z</dc:date>
 </item>
 <item rdf:about="https://www.snipit.org/public/alan/viewsnip.php?id=1766">
  <description>Approximate box decomposition trees&#10;Arya et al. [4] have presented an optimal algorithm for  ...</description>
  <link>https://www.snipit.org/public/alan/viewsnip.php?id=1766</link>
  <title>Approximate box decomposition trees</title>
  <dc:source>http://www.ais.fraunhofer.de/~surmann/papers/icar2005_2/node17.html</dc:source>
  <dc:date>2006-07-24T22:08:33Z</dc:date>
 </item>
 <item rdf:about="https://www.snipit.org/public/alan/viewsnip.php?id=1765">
  <description>Kd-Trees&#10;  figure8146&#10;Input description: A set S of n points in k dimensions.&#10;Problem description: Construct a tree that partitions th ...</description>
  <link>https://www.snipit.org/public/alan/viewsnip.php?id=1765</link>
  <title>Kd-Trees</title>
  <dc:source>http://www2.toki.or.id/book/AlgDesignManual/BOOK/BOOK3/NODE134.HTM</dc:source>
  <dc:date>2006-07-24T22:07:18Z</dc:date>
 </item>
 <item rdf:about="https://www.snipit.org/public/alan/viewsnip.php?id=1764">
  <description>k-d tree&#10;(data structure)&#10;Definition: A multidimensional search tree for points in ...&#10;See also binary search tree, adaptive k-d tree, point ac ...&#10;Note: After [GG98]. Robert Keith Oswald (rko9h@virginia. ...</description>
  <link>https://www.snipit.org/public/alan/viewsnip.php?id=1764</link>
  <title>k-d tree</title>
  <dc:source>http://www.nist.gov/dads/HTML/kdtree.html</dc:source>
  <dc:date>2006-07-24T22:06:15Z</dc:date>
 </item>
 <item rdf:about="https://www.snipit.org/public/alan/viewsnip.php?id=1762">
  <description>ANN is a library written in C++, which supports data str... &#10;In the nearest neighbor problem a set of data points in  ...&#10;Based on our own experience, ANN performs quite efficien ...&#10;The library implements a number of different data struct ...&#10;The library</description>
  <link>https://www.snipit.org/public/alan/viewsnip.php?id=1762</link>
  <title>ANN - Approximate Nearest Neighbor Library</title>
  <dc:source>http://www.cs.umd.edu/~mount/ANN/</dc:source>
  <dc:date>2006-07-24T22:04:01Z</dc:date>
 </item>
</rdf:RDF>