<?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/"
	
	>
<channel>
	<title>Comments on: Computer Algorithms: Adding Large Integers</title>
	<atom:link href="/2013/01/07/computer-algorithms-adding-large-integers/feed/" rel="self" type="application/rss+xml" />
	<link>/2013/01/07/computer-algorithms-adding-large-integers/</link>
	<description>on web development</description>
	<lastBuildDate>Fri, 26 Oct 2018 21:40:18 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>https://wordpress.org/?v=5.0.3</generator>
	<item>
		<title>By: Scooby Doo</title>
		<link>/2013/01/07/computer-algorithms-adding-large-integers/comment-page-1/#comment-18585</link>
		<dc:creator><![CDATA[Scooby Doo]]></dc:creator>
		<pubDate>Fri, 05 Apr 2013 09:00:37 +0000</pubDate>
		<guid isPermaLink="false">/?p=3525#comment-18585</guid>
		<description><![CDATA[Well, I just can`t agree with you on that, Erik! The first time it took them 70 seconds because only one of them did the addition( let`s be honest, someone can take care of the carry overs in no time at all ) and the second time it took them half that time because they divided the task into 2 smaller problems which they could solve AT THE SAME TIME! So half the time for half the number... looks like simple math to me. The computer still has to add both halfs, so it would make no difference.]]></description>
		<content:encoded><![CDATA[<p>Well, I just can`t agree with you on that, Erik! The first time it took them 70 seconds because only one of them did the addition( let`s be honest, someone can take care of the carry overs in no time at all ) and the second time it took them half that time because they divided the task into 2 smaller problems which they could solve AT THE SAME TIME! So half the time for half the number&#8230; looks like simple math to me. The computer still has to add both halfs, so it would make no difference.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Erik</title>
		<link>/2013/01/07/computer-algorithms-adding-large-integers/comment-page-1/#comment-18184</link>
		<dc:creator><![CDATA[Erik]]></dc:creator>
		<pubDate>Thu, 17 Jan 2013 05:41:49 +0000</pubDate>
		<guid isPermaLink="false">/?p=3525#comment-18184</guid>
		<description><![CDATA[I don&#039;t fully agree with you. I illustrated this to two students of mine in the following way: A wrote two large numbers (in decimal) on the white board, one above the other, and told my two students to work as a team and add the numbers as fast as possible. They were allowed to discuss and come up with a strategy, but once ready, I said I would clock them. They decided on the following strategy: one would add single digit pairs and the other would take care of the carry overs. It took them 70 seconds to add the two numbers. Then I told them to try another strategy: Draw a vertical line through the middle of the two numbers, and then one adds the the part to the left and the other adds the part two the right. Although one of the students was puzzled for a moment, the other got it right away. He drew the line (took a second to think about where to draw it) and they proceeded as I had suggested. This time it took them 35 seconds.  &quot;What about carry over from the right part to the left part&quot;, I asked them. &quot;There is no carry over&quot;, said the guy who had drawn the line. &quot;You see, I drew the line here, so that there wouldn&#039;t be any carry over.&quot;

So the algorithm we all learn in school is not always the fastest one!]]></description>
		<content:encoded><![CDATA[<p>I don&#8217;t fully agree with you. I illustrated this to two students of mine in the following way: A wrote two large numbers (in decimal) on the white board, one above the other, and told my two students to work as a team and add the numbers as fast as possible. They were allowed to discuss and come up with a strategy, but once ready, I said I would clock them. They decided on the following strategy: one would add single digit pairs and the other would take care of the carry overs. It took them 70 seconds to add the two numbers. Then I told them to try another strategy: Draw a vertical line through the middle of the two numbers, and then one adds the the part to the left and the other adds the part two the right. Although one of the students was puzzled for a moment, the other got it right away. He drew the line (took a second to think about where to draw it) and they proceeded as I had suggested. This time it took them 35 seconds.  &#8220;What about carry over from the right part to the left part&#8221;, I asked them. &#8220;There is no carry over&#8221;, said the guy who had drawn the line. &#8220;You see, I drew the line here, so that there wouldn&#8217;t be any carry over.&#8221;</p>
<p>So the algorithm we all learn in school is not always the fastest one!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: dvh</title>
		<link>/2013/01/07/computer-algorithms-adding-large-integers/comment-page-1/#comment-18096</link>
		<dc:creator><![CDATA[dvh]]></dc:creator>
		<pubDate>Tue, 08 Jan 2013 15:12:13 +0000</pubDate>
		<guid isPermaLink="false">/?p=3525#comment-18096</guid>
		<description><![CDATA[well, probably correct when seen as a simplification.
however, taking a microscope and looking at the gate-level, you&#039;ll see that there IS a difference between doing addition the &#039;serial way&#039; we learned at school and using a carry-look-ahead-adder, which IS faster than the simple, straight forward algorithm.]]></description>
		<content:encoded><![CDATA[<p>well, probably correct when seen as a simplification.<br />
however, taking a microscope and looking at the gate-level, you&#8217;ll see that there IS a difference between doing addition the &#8216;serial way&#8217; we learned at school and using a carry-look-ahead-adder, which IS faster than the simple, straight forward algorithm.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
