<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Assembly Archives &#8211; Beer &amp; Skittles</title>
	<atom:link href="https://nelson.ph/archives/programming/assembly/feed/" rel="self" type="application/rss+xml" />
	<link>https://nelson.ph/archives/programming/assembly/</link>
	<description>Life is not all beer and skittles</description>
	<lastBuildDate>Sun, 08 Mar 2020 18:44:34 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.7.2</generator>
<site xmlns="com-wordpress:feed-additions:1">177521838</site>	<item>
		<title>Assembly: Finding Composite Numbers</title>
		<link>https://nelson.ph/2007/09/assembly-finding-composite-numbers/</link>
					<comments>https://nelson.ph/2007/09/assembly-finding-composite-numbers/#respond</comments>
		
		<dc:creator><![CDATA[Nelson]]></dc:creator>
		<pubDate>Sun, 23 Sep 2007 08:18:34 +0000</pubDate>
				<category><![CDATA[Assembly]]></category>
		<guid isPermaLink="false">http://www.flirt-wind.net/2007/09/23/assembly-finding-composite-numbers/</guid>

					<description><![CDATA[<p>This program asks for a numeric input and finds all the composite numbers up to that limit. I think this was our first &#8220;major&#8221; exercise in CMSC 131. I had to ask help from some of my classmates to fully accomplish it, particularly from Jen in changing a line in the increment block. Unlike inc, [&#8230;]</p>
<p>The post <a href="https://nelson.ph/2007/09/assembly-finding-composite-numbers/">Assembly: Finding Composite Numbers</a> appeared first on <a href="https://nelson.ph">Beer &amp; Skittles</a>.</p>
]]></description>
										<content:encoded><![CDATA[<p>This program asks for a numeric input and finds all the composite numbers up to that limit. I think this was our first &#8220;major&#8221; exercise in CMSC 131. I had to ask help from some of my classmates to fully accomplish it, particularly from Jen in changing a line in the <strong>increment</strong> block. Unlike <em>inc</em>, the <em>add</em> command was producing an infinite loop.</p>
<p>Problems like this are way easier to solve in high-level languages. So isn&#8217;t it rather fascinating how you do it the computer&#8217;s way?</p>
<p><strong>P.S.</strong> There&#8217;s already a connection in the dorm! 😛 Not yet extended to the rooms though. Tsk.</p>
<blockquote><p>
<strong><a href="https://nelsoft.org/files/code/composite.asm">composite.asm</a></strong></p></blockquote>
<p>The post <a href="https://nelson.ph/2007/09/assembly-finding-composite-numbers/">Assembly: Finding Composite Numbers</a> appeared first on <a href="https://nelson.ph">Beer &amp; Skittles</a>.</p>
]]></content:encoded>
					
					<wfw:commentRss>https://nelson.ph/2007/09/assembly-finding-composite-numbers/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">108</post-id>	</item>
	</channel>
</rss>
