<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments on: Standard Algorithms 3 &amp; 4</title>
	<atom:link href="http://craigmounthighercomputing.wordpress.com/2007/12/03/standard-algorithms-3-4/feed/" rel="self" type="application/rss+xml" />
	<link>http://craigmounthighercomputing.wordpress.com/2007/12/03/standard-algorithms-3-4/</link>
	<description>Higher Computing 2007 - 2008 at Craigmount</description>
	<lastBuildDate>Wed, 29 Apr 2009 20:59:15 +0000</lastBuildDate>
	<generator>http://wordpress.com/</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: mrwhiteside</title>
		<link>http://craigmounthighercomputing.wordpress.com/2007/12/03/standard-algorithms-3-4/#comment-53</link>
		<dc:creator>mrwhiteside</dc:creator>
		<pubDate>Fri, 07 Dec 2007 12:23:38 +0000</pubDate>
		<guid isPermaLink="false">http://craigmounthighercomputing.wordpress.com/2007/12/03/standard-algorithms-3-4/#comment-53</guid>
		<description>Hi Abby, perhaps we can find some music to program to that everyone wants to hear but is not particularly christmassy?  I will let you come up with some suggestions!

I think algorithm 1 and 2 go together as the code is pretty much the same for each of them except that in conuting occurrences you keep a count and in linear search you store the position.  3 and 4 are obviously very similar in the way they work.

All of these however, could come up in any form in the exam and are quite often changed to fit a random example.  Hope this helps!</description>
		<content:encoded><![CDATA[<p>Hi Abby, perhaps we can find some music to program to that everyone wants to hear but is not particularly christmassy?  I will let you come up with some suggestions!</p>
<p>I think algorithm 1 and 2 go together as the code is pretty much the same for each of them except that in conuting occurrences you keep a count and in linear search you store the position.  3 and 4 are obviously very similar in the way they work.</p>
<p>All of these however, could come up in any form in the exam and are quite often changed to fit a random example.  Hope this helps!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Abby</title>
		<link>http://craigmounthighercomputing.wordpress.com/2007/12/03/standard-algorithms-3-4/#comment-52</link>
		<dc:creator>Abby</dc:creator>
		<pubDate>Fri, 07 Dec 2007 10:08:47 +0000</pubDate>
		<guid isPermaLink="false">http://craigmounthighercomputing.wordpress.com/2007/12/03/standard-algorithms-3-4/#comment-52</guid>
		<description>Please no more xmas music :(
so do standard algorithms 1 and 2 go together and 3 and 4 go together?</description>
		<content:encoded><![CDATA[<p>Please no more xmas music <img src='http://s.wordpress.com/wp-includes/images/smilies/icon_sad.gif' alt=':(' class='wp-smiley' /><br />
so do standard algorithms 1 and 2 go together and 3 and 4 go together?</p>
]]></content:encoded>
	</item>
</channel>
</rss>
