<?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>bodom_lx blog and things &#187; algorithms</title>
	<atom:link href="http://bd-things.net/tag/algorithms/feed/" rel="self" type="application/rss+xml" />
	<link>http://bd-things.net</link>
	<description>Trying to be mathematically simple and precise</description>
	<lastBuildDate>Fri, 05 Mar 2010 16:36:41 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>Wiki set up, first meeting</title>
		<link>http://bd-things.net/wiki-set-up-first-meeting/</link>
		<comments>http://bd-things.net/wiki-set-up-first-meeting/#comments</comments>
		<pubDate>Wed, 14 Oct 2009 14:46:16 +0000</pubDate>
		<dc:creator>bodom_lx</dc:creator>
				<category><![CDATA[Carpooling Research]]></category>
		<category><![CDATA[algorithms]]></category>
		<category><![CDATA[api]]></category>
		<category><![CDATA[Blog]]></category>
		<category><![CDATA[comparison of scientific papers]]></category>
		<category><![CDATA[Design]]></category>
		<category><![CDATA[dynamic]]></category>
		<category><![CDATA[dynamic carpooling]]></category>
		<category><![CDATA[FBK]]></category>
		<category><![CDATA[grid]]></category>
		<category><![CDATA[HTTP]]></category>
		<category><![CDATA[paper]]></category>
		<category><![CDATA[pro]]></category>
		<category><![CDATA[promise]]></category>
		<category><![CDATA[PUT]]></category>
		<category><![CDATA[research]]></category>
		<category><![CDATA[set]]></category>
		<category><![CDATA[url]]></category>
		<category><![CDATA[Wiki]]></category>

		<guid isPermaLink="false">http://bd-things.net/?p=1401</guid>
		<description><![CDATA[Both the Wiki and the blog has been set up. Tomorrow I&#8217;m going to have the first official meeting at FBK to discuss my first results.
I&#8217;ve just finished the grid containing a short description that each paper proposed as a solution (or suggest) for the areas:

System Suggestions
Interface Design
Algorithms
Coordination
Trustiness
Safety/Reputation Systems
Social Aspects
Chicken-Eggs problem
Incentives

The WIKI is located at ]]></description>
		<wfw:commentRss>http://bd-things.net/wiki-set-up-first-meeting/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Hash Maps with linear probing and separate chaining</title>
		<link>http://bd-things.net/hash-maps-with-linear-probing-and-separate-chaining/</link>
		<comments>http://bd-things.net/hash-maps-with-linear-probing-and-separate-chaining/#comments</comments>
		<pubDate>Mon, 28 Apr 2008 09:55:20 +0000</pubDate>
		<dc:creator>bodom_lx</dc:creator>
				<category><![CDATA[Programming]]></category>
		<category><![CDATA[address]]></category>
		<category><![CDATA[algorithms]]></category>
		<category><![CDATA[C language]]></category>
		<category><![CDATA[code]]></category>
		<category><![CDATA[data structures]]></category>
		<category><![CDATA[Download]]></category>
		<category><![CDATA[hash]]></category>
		<category><![CDATA[hash map]]></category>
		<category><![CDATA[hash table]]></category>
		<category><![CDATA[HTTP]]></category>
		<category><![CDATA[java]]></category>
		<category><![CDATA[javascript]]></category>
		<category><![CDATA[link]]></category>
		<category><![CDATA[list]]></category>
		<category><![CDATA[page]]></category>
		<category><![CDATA[pageTracker]]></category>
		<category><![CDATA[php]]></category>
		<category><![CDATA[pro]]></category>
		<category><![CDATA[rest]]></category>
		<category><![CDATA[source]]></category>
		<category><![CDATA[source code]]></category>
		<category><![CDATA[Wiki]]></category>
		<category><![CDATA[wikipedia]]></category>

		<guid isPermaLink="false">http://bd-things.net/?p=308</guid>
		<description><![CDATA[Time for two new C programs! At the DSA course I learned something about Hash Tables and collision resolutions.
I just implemented insert/search/print operations.
The first source code is an implementation of a Hash Map with open addressing (linear probing) as collision resolution method.
The following are the interesting functions of the program. As always, take a look ]]></description>
		<wfw:commentRss>http://bd-things.net/hash-maps-with-linear-probing-and-separate-chaining/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>A Generic Quicksort Implementation in C</title>
		<link>http://bd-things.net/a-generic-quicksort-implementation-in-c/</link>
		<comments>http://bd-things.net/a-generic-quicksort-implementation-in-c/#comments</comments>
		<pubDate>Mon, 07 Apr 2008 09:58:42 +0000</pubDate>
		<dc:creator>bodom_lx</dc:creator>
				<category><![CDATA[Programming]]></category>
		<category><![CDATA[algorithms]]></category>
		<category><![CDATA[C language]]></category>
		<category><![CDATA[code]]></category>
		<category><![CDATA[data structures]]></category>
		<category><![CDATA[Design]]></category>
		<category><![CDATA[Download]]></category>
		<category><![CDATA[HTTP]]></category>
		<category><![CDATA[java]]></category>
		<category><![CDATA[javascript]]></category>
		<category><![CDATA[language]]></category>
		<category><![CDATA[page]]></category>
		<category><![CDATA[pageTracker]]></category>
		<category><![CDATA[php]]></category>
		<category><![CDATA[rest]]></category>
		<category><![CDATA[source]]></category>
		<category><![CDATA[source code]]></category>
		<category><![CDATA[version]]></category>
		<category><![CDATA[Wiki]]></category>
		<category><![CDATA[wikipedia]]></category>

		<guid isPermaLink="false">http://bd-things.net/?p=295</guid>
		<description><![CDATA[As assignment for Data Structures and Algorithms course, we had to work with a modified version of the quicksort algorithm. It came obvious that for modifying a qsort you need to implement it  
It is difficult to find a clear quicksort algorithm implemented, so I wrote it.
Here is the generic C implementation of the ]]></description>
		<wfw:commentRss>http://bd-things.net/a-generic-quicksort-implementation-in-c/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Two IT guys and DSA assignments</title>
		<link>http://bd-things.net/two-it-guys-and-dsa-assignments/</link>
		<comments>http://bd-things.net/two-it-guys-and-dsa-assignments/#comments</comments>
		<pubDate>Sat, 15 Mar 2008 23:18:39 +0000</pubDate>
		<dc:creator>bodom_lx</dc:creator>
				<category><![CDATA[Misc]]></category>
		<category><![CDATA[Unibz]]></category>
		<category><![CDATA[algorithms]]></category>
		<category><![CDATA[data structures]]></category>
		<category><![CDATA[HTTP]]></category>
		<category><![CDATA[life]]></category>
		<category><![CDATA[university]]></category>

		<guid isPermaLink="false">http://bd-things.net/two-it-guys-and-dsa-assignments/</guid>
		<description><![CDATA[This is what happens if you give to two IT students a stressful assignment of &#8220;Data Structures
and Algorithms&#8221;, 48 hours of their meaningful life, the loss of a saturday night, and the 6th
floor of the most recent building of the Free University of Bolzano:

..they begin to behave like real IT guys..and to build their ideal ]]></description>
		<wfw:commentRss>http://bd-things.net/two-it-guys-and-dsa-assignments/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Sorting array elements with C language</title>
		<link>http://bd-things.net/sorting-array-elements-with-c-language/</link>
		<comments>http://bd-things.net/sorting-array-elements-with-c-language/#comments</comments>
		<pubDate>Sat, 23 Feb 2008 14:09:59 +0000</pubDate>
		<dc:creator>bodom_lx</dc:creator>
				<category><![CDATA[Programming]]></category>
		<category><![CDATA[algorithms]]></category>
		<category><![CDATA[C language]]></category>
		<category><![CDATA[code]]></category>
		<category><![CDATA[data structures]]></category>
		<category><![CDATA[Download]]></category>
		<category><![CDATA[elements of]]></category>
		<category><![CDATA[HTTP]]></category>
		<category><![CDATA[java]]></category>
		<category><![CDATA[javascript]]></category>
		<category><![CDATA[language]]></category>
		<category><![CDATA[page]]></category>
		<category><![CDATA[pageTracker]]></category>
		<category><![CDATA[php]]></category>
		<category><![CDATA[pointer]]></category>
		<category><![CDATA[pointers]]></category>
		<category><![CDATA[pro]]></category>
		<category><![CDATA[PUT]]></category>
		<category><![CDATA[rest]]></category>
		<category><![CDATA[source]]></category>
		<category><![CDATA[source code]]></category>
		<category><![CDATA[tiny c]]></category>
		<category><![CDATA[Unibz]]></category>
		<category><![CDATA[Wiki]]></category>
		<category><![CDATA[wikipedia]]></category>

		<guid isPermaLink="false">http://bd-things.net/sorting-array-elements-with-c-language/</guid>
		<description><![CDATA[UPDATE 17:19: it seems that the program I implemented today uses a kind of Bubble Sort algorithm, give it a try, it&#8217;s quite interesting!
After 3 long days studying C, I think I&#8217;ve assimilated a good knowledge base for the incoming semester.
So there is a tiny C program that sorts the elements of a given integer ]]></description>
		<wfw:commentRss>http://bd-things.net/sorting-array-elements-with-c-language/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
	</channel>
</rss>
