<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress/2.2.1" -->
<rss version="0.92">
<channel>
	<title>Programmering</title>
	<link>http://dahoiv.net/programmering</link>
	<description>- Mine programerings prosjekter</description>
	<lastBuildDate>Sat, 29 Sep 2007 17:06:27 +0000</lastBuildDate>
	<docs>http://backend.userland.com/rss092</docs>
	<language>en</language>
	
	<item>
		<title>Quick sort</title>
		<description><![CDATA[Quick sort in Python
def sort(A):
if len(A) &#60;= 1:
return A
small = []
middle = []
big = []
temp = int((A[0][0]+A[len(A)-1][0])/2)
for x in A:
if x[0] &#60; temp:
small.append(x)
elif x[0] == temp:
middle.append(x)
elif x[0] &#62; temp:
big.append(x)
A = sort(small)
A.extend(middle)
A.extend(sort(big))
return A
]]></description>
		<link>http://dahoiv.net/programmering/uncategorized/quick-sort</link>
			</item>
	<item>
		<title>Nim</title>
		<description><![CDATA[Nim is a two-player game in which players take turns removing objects from distinct heaps. On each turn, a player must remove at least one object. The player who take the last object loses.
]]></description>
		<link>http://dahoiv.net/programmering/cpp/nim</link>
			</item>
	<item>
		<title>Project Euler - problem 092</title>
		<description><![CDATA[A number chain is created by continuously adding the square of the digits in a number to form a new number until it has been seen before.
For example,
44 -&#62; 32 -&#62; 13 -&#62; 10 -&#62; 1 -&#62; 1
85 -&#62; 89 -&#62; 145 -&#62; 42 -&#62; 20 -&#62; 4 -&#62; 16 -&#62; 37 -&#62; 58 -&#62; [...]]]></description>
		<link>http://dahoiv.net/programmering/cpp/project-euler-problem-092</link>
			</item>
	<item>
		<title>Project Euler - problem 030</title>
		<description><![CDATA[Surprisingly there are only three numbers that can be written as the sum of fourth powers of their digits:
1634 = 14 + 64 + 34 + 44
8208 = 84 + 24 + 04 + 84
9474 = 94 + 44 + 74 + 44
As 1 = 14 is not a sum it is not included.
The sum [...]]]></description>
		<link>http://dahoiv.net/programmering/cpp/project-euler-problem-030</link>
			</item>
	<item>
		<title>Project Euler - problem 015</title>
		<description><![CDATA[Starting in the top left corner of a 2*2 grid, there are 6 routes (without backtracking) to the bottom right corner.
How many routes are there through a 20*20 grid?
]]></description>
		<link>http://dahoiv.net/programmering/cpp/project-euler-problem-015</link>
			</item>
	<item>
		<title>Project Euler - problem 014</title>
		<description><![CDATA[The following iterative sequence is defined for the set of positive integers:
n -&#62;n/2 (n is even)
n -&#62;3n + 1 (n is odd)
Using the rule above and starting with 13, we generate the following sequence:
13 -&#62; 40 -&#62; 20 -&#62; 10 -&#62; 5 -&#62; 16 -&#62; 8 -&#62; 4 -&#62; 2 -&#62; 1
It can be seen [...]]]></description>
		<link>http://dahoiv.net/programmering/cpp/project-euler-problem-014</link>
			</item>
	<item>
		<title>Project Euler - problem 012</title>
		<description><![CDATA[The sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The first ten terms would be:
1, 3, 6, 10, 15, 21, 28, 36, 45, 55, &#8230;
Let us list the factors of [...]]]></description>
		<link>http://dahoiv.net/programmering/cpp/project-euler-problem-012</link>
			</item>
	<item>
		<title>Project Euler - problem 010</title>
		<description><![CDATA[The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.
Find the sum of all the primes below one million.
]]></description>
		<link>http://dahoiv.net/programmering/cpp/project-euler-problem-010</link>
			</item>
	<item>
		<title>Project Euler - problem 009</title>
		<description><![CDATA[A Pythagorean triplet is a set of three natural numbers, a&#60;b&#60;c, for which,
a² + b² = c²
For example, 3² + 4² = 9 + 16 = 25 = 5².
There exists exactly one Pythagorean triplet for which a + b + c = 1000.
Find the product abc.
]]></description>
		<link>http://dahoiv.net/programmering/cpp/project-euler-problem-009</link>
			</item>
	<item>
		<title>Project Euler - problem 007</title>
		<description><![CDATA[By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.
What is the 10001st prime number?
]]></description>
		<link>http://dahoiv.net/programmering/cpp/project-euler-problem-007</link>
			</item>
</channel>
</rss>
