<?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/"
	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>Code Chunks</title>
	<atom:link href="http://algorithmfun.wordpress.com/feed/" rel="self" type="application/rss+xml" />
	<link>http://algorithmfun.wordpress.com</link>
	<description>You do your experimentation, I will do mine.</description>
	<lastBuildDate>Fri, 11 Feb 2011 16:44:46 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
<cloud domain='algorithmfun.wordpress.com' port='80' path='/?rsscloud=notify' registerProcedure='' protocol='http-post' />
<image>
		<url>http://1.gravatar.com/blavatar/f90502f9c565822e9c8e01379573b416?s=96&#038;d=http%3A%2F%2Fs2.wp.com%2Fi%2Fbuttonw-com.png</url>
		<title>Code Chunks</title>
		<link>http://algorithmfun.wordpress.com</link>
	</image>
	<atom:link rel="search" type="application/opensearchdescription+xml" href="http://algorithmfun.wordpress.com/osd.xml" title="Code Chunks" />
	<atom:link rel='hub' href='http://algorithmfun.wordpress.com/?pushpress=hub'/>
		<item>
		<title>XML Sequence Delimiter</title>
		<link>http://algorithmfun.wordpress.com/2010/10/27/xml-sequence-delimiter/</link>
		<comments>http://algorithmfun.wordpress.com/2010/10/27/xml-sequence-delimiter/#comments</comments>
		<pubDate>Wed, 27 Oct 2010 17:30:20 +0000</pubDate>
		<dc:creator>Sandeep Phukan</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Java]]></category>
		<category><![CDATA[Recursion]]></category>
		<category><![CDATA[XML]]></category>

		<guid isPermaLink="false">http://algorithmfun.wordpress.com/?p=162</guid>
		<description><![CDATA[An XML  sequence delimiter might be required for processing XML streams without the boiler plate code that comes with well known XML Parsers. A simple use case might be converting xml transformations on the fly like producing a partial output of the xml transformation as the user punches the script, etc.  This one uses a&#160;&#8230; <a href="http://algorithmfun.wordpress.com/2010/10/27/xml-sequence-delimiter/">Read&#160;more</a><img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=algorithmfun.wordpress.com&amp;blog=2436670&amp;post=162&amp;subd=algorithmfun&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://algorithmfun.wordpress.com/2010/10/27/xml-sequence-delimiter/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/af212ec63c07eac26ccb9284e3e4667a?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">middleware</media:title>
		</media:content>
	</item>
		<item>
		<title>Find nth largest value in a BST</title>
		<link>http://algorithmfun.wordpress.com/2010/07/18/find-nth-largest-value-in-a-bst/</link>
		<comments>http://algorithmfun.wordpress.com/2010/07/18/find-nth-largest-value-in-a-bst/#comments</comments>
		<pubDate>Sun, 18 Jul 2010 20:53:01 +0000</pubDate>
		<dc:creator>Sandeep Phukan</dc:creator>
				<category><![CDATA[Algorithms]]></category>

		<guid isPermaLink="false">http://algorithmfun.wordpress.com/?p=155</guid>
		<description><![CDATA[Simplest solution is to do a reverse in order search and maintain a global counter. ReverseInOrder(Tree T, n) 1. if (T-&#62;right != null ) ReverseInOrder(T-&#62;right) 2. if (count==n) return T. Else count++ 3. if (T-&#62;left != null ) ReverseInOrder(T-&#62;left)<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=algorithmfun.wordpress.com&amp;blog=2436670&amp;post=155&amp;subd=algorithmfun&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://algorithmfun.wordpress.com/2010/07/18/find-nth-largest-value-in-a-bst/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/af212ec63c07eac26ccb9284e3e4667a?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">middleware</media:title>
		</media:content>
	</item>
		<item>
		<title>Find minimum edit distance between two strings</title>
		<link>http://algorithmfun.wordpress.com/2010/07/18/find-minimum-edit-distance-between-two-strings/</link>
		<comments>http://algorithmfun.wordpress.com/2010/07/18/find-minimum-edit-distance-between-two-strings/#comments</comments>
		<pubDate>Sun, 18 Jul 2010 20:47:22 +0000</pubDate>
		<dc:creator>Sandeep Phukan</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Java]]></category>
		<category><![CDATA[Strings]]></category>

		<guid isPermaLink="false">http://algorithmfun.wordpress.com/?p=152</guid>
		<description><![CDATA[This can be solved using Levenshtein distance. The solution below uses a temp matrix [0...n][0...m]. This is usually not a good approach for handling large strings. Other approaches are via hash functions. package strings; /** * Implements the Lavenshtein algorithm to find the minimum number of edits * to change one string to another *&#160;&#8230; <a href="http://algorithmfun.wordpress.com/2010/07/18/find-minimum-edit-distance-between-two-strings/">Read&#160;more</a><img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=algorithmfun.wordpress.com&amp;blog=2436670&amp;post=152&amp;subd=algorithmfun&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://algorithmfun.wordpress.com/2010/07/18/find-minimum-edit-distance-between-two-strings/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/af212ec63c07eac26ccb9284e3e4667a?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">middleware</media:title>
		</media:content>
	</item>
		<item>
		<title>Sorting a Stack using push,pop,isEmpty and peek</title>
		<link>http://algorithmfun.wordpress.com/2010/07/18/sorting-a-stack-using-pushpopisempty-and-peek/</link>
		<comments>http://algorithmfun.wordpress.com/2010/07/18/sorting-a-stack-using-pushpopisempty-and-peek/#comments</comments>
		<pubDate>Sun, 18 Jul 2010 20:41:15 +0000</pubDate>
		<dc:creator>Sandeep Phukan</dc:creator>
				<category><![CDATA[array]]></category>
		<category><![CDATA[Java]]></category>
		<category><![CDATA[sorting]]></category>

		<guid isPermaLink="false">http://algorithmfun.wordpress.com/?p=149</guid>
		<description><![CDATA[Problem Definition: Sort a Stack using standard operations  push,pop,isEmpty and peek. Solutions: 1. Use an additional array of size n, insert into array (Time Complexity O(n)). Use Counting Sort (Complexity O(n)). Memory overhead of O(m+n). 2. Use recursion with no additional space. The time complexity is O(n) and O(1) space complexity. The following code is&#160;&#8230; <a href="http://algorithmfun.wordpress.com/2010/07/18/sorting-a-stack-using-pushpopisempty-and-peek/">Read&#160;more</a><img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=algorithmfun.wordpress.com&amp;blog=2436670&amp;post=149&amp;subd=algorithmfun&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://algorithmfun.wordpress.com/2010/07/18/sorting-a-stack-using-pushpopisempty-and-peek/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/af212ec63c07eac26ccb9284e3e4667a?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">middleware</media:title>
		</media:content>
	</item>
		<item>
		<title>Anagram Checker</title>
		<link>http://algorithmfun.wordpress.com/2010/07/17/anagram-checker/</link>
		<comments>http://algorithmfun.wordpress.com/2010/07/17/anagram-checker/#comments</comments>
		<pubDate>Sat, 17 Jul 2010 21:27:03 +0000</pubDate>
		<dc:creator>Sandeep Phukan</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[array]]></category>
		<category><![CDATA[Java]]></category>
		<category><![CDATA[Strings]]></category>

		<guid isPermaLink="false">http://algorithmfun.wordpress.com/?p=145</guid>
		<description><![CDATA[A simple way to check if two strings are anagrams is to find out if the numeric sum of the characters in the strings is equal. The approach below uses a hash function that returns the sum of the characters in the string. The running time is O(n) but has a space overhead proportional to&#160;&#8230; <a href="http://algorithmfun.wordpress.com/2010/07/17/anagram-checker/">Read&#160;more</a><img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=algorithmfun.wordpress.com&amp;blog=2436670&amp;post=145&amp;subd=algorithmfun&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://algorithmfun.wordpress.com/2010/07/17/anagram-checker/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/af212ec63c07eac26ccb9284e3e4667a?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">middleware</media:title>
		</media:content>
	</item>
		<item>
		<title>Finding kth Smallest Value or Largest Value</title>
		<link>http://algorithmfun.wordpress.com/2010/07/15/finding-kth-smallest-value-or-largest-value/</link>
		<comments>http://algorithmfun.wordpress.com/2010/07/15/finding-kth-smallest-value-or-largest-value/#comments</comments>
		<pubDate>Thu, 15 Jul 2010 21:08:55 +0000</pubDate>
		<dc:creator>Sandeep Phukan</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[array]]></category>
		<category><![CDATA[Java]]></category>
		<category><![CDATA[sorting]]></category>

		<guid isPermaLink="false">http://algorithmfun.wordpress.com/?p=130</guid>
		<description><![CDATA[This problem is a good one. Options available are: 1. Sort the entire array using Counting Sort ( see. linear-sorting-using-counting-sort ) and print out the kth index of the result array. Time Complexity is O(n) and Space Complexity is O(n+m) 2. Use a Randomized Selection Sort. The Time Complexity is O(n) and Space Complexity is&#160;&#8230; <a href="http://algorithmfun.wordpress.com/2010/07/15/finding-kth-smallest-value-or-largest-value/">Read&#160;more</a><img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=algorithmfun.wordpress.com&amp;blog=2436670&amp;post=130&amp;subd=algorithmfun&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://algorithmfun.wordpress.com/2010/07/15/finding-kth-smallest-value-or-largest-value/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/af212ec63c07eac26ccb9284e3e4667a?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">middleware</media:title>
		</media:content>
	</item>
		<item>
		<title>Linear Sorting using Counting Sort</title>
		<link>http://algorithmfun.wordpress.com/2010/07/14/linear-sorting-using-counting-sort/</link>
		<comments>http://algorithmfun.wordpress.com/2010/07/14/linear-sorting-using-counting-sort/#comments</comments>
		<pubDate>Wed, 14 Jul 2010 19:46:37 +0000</pubDate>
		<dc:creator>Sandeep Phukan</dc:creator>
				<category><![CDATA[array]]></category>
		<category><![CDATA[Java]]></category>
		<category><![CDATA[sorting]]></category>

		<guid isPermaLink="false">http://algorithmfun.wordpress.com/?p=125</guid>
		<description><![CDATA[Nothing much.. just a simple implementation of the Counting Sort. Time Complexity is O(n) and space complexity is O(n+m). package sorting; /** * * @author Sandeep Phukan * Implements a count sort with O(n) time complexity * */ public class CountSort { int[] tempArray=null; int[] resultArray=null; public int[] sort(int[] inputArray,int maxNumber){ tempArray=new int[maxNumber+1]; //Actually this&#160;&#8230; <a href="http://algorithmfun.wordpress.com/2010/07/14/linear-sorting-using-counting-sort/">Read&#160;more</a><img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=algorithmfun.wordpress.com&amp;blog=2436670&amp;post=125&amp;subd=algorithmfun&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://algorithmfun.wordpress.com/2010/07/14/linear-sorting-using-counting-sort/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/af212ec63c07eac26ccb9284e3e4667a?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">middleware</media:title>
		</media:content>
	</item>
		<item>
		<title>Frequency Finder</title>
		<link>http://algorithmfun.wordpress.com/2010/07/14/frequency-finder-2/</link>
		<comments>http://algorithmfun.wordpress.com/2010/07/14/frequency-finder-2/#comments</comments>
		<pubDate>Wed, 14 Jul 2010 18:42:05 +0000</pubDate>
		<dc:creator>Sandeep Phukan</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[array]]></category>
		<category><![CDATA[Java]]></category>

		<guid isPermaLink="false">http://algorithmfun.wordpress.com/?p=118</guid>
		<description><![CDATA[Heres another version of the frequency finder that is based on arrays ( as against maps used in the previous post), has O(n) time complexity and O(n+m) space complexity. Note that the same concept can also be used to remove repetitive numbers or characters from a string. package misc; /** * * @author Sandeep Phukan&#160;&#8230; <a href="http://algorithmfun.wordpress.com/2010/07/14/frequency-finder-2/">Read&#160;more</a><img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=algorithmfun.wordpress.com&amp;blog=2436670&amp;post=118&amp;subd=algorithmfun&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://algorithmfun.wordpress.com/2010/07/14/frequency-finder-2/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/af212ec63c07eac26ccb9284e3e4667a?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">middleware</media:title>
		</media:content>
	</item>
		<item>
		<title>Problems that need to be discussed</title>
		<link>http://algorithmfun.wordpress.com/2010/06/21/problems-that-need-to-be-discussed/</link>
		<comments>http://algorithmfun.wordpress.com/2010/06/21/problems-that-need-to-be-discussed/#comments</comments>
		<pubDate>Mon, 21 Jun 2010 20:10:35 +0000</pubDate>
		<dc:creator>Sandeep Phukan</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Strings]]></category>
		<category><![CDATA[text handling]]></category>

		<guid isPermaLink="false">http://algorithmfun.wordpress.com/?p=55</guid>
		<description><![CDATA[unsolved!!!<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=algorithmfun.wordpress.com&amp;blog=2436670&amp;post=55&amp;subd=algorithmfun&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://algorithmfun.wordpress.com/2010/06/21/problems-that-need-to-be-discussed/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/af212ec63c07eac26ccb9284e3e4667a?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">middleware</media:title>
		</media:content>
	</item>
		<item>
		<title>Compare two string literals</title>
		<link>http://algorithmfun.wordpress.com/2010/06/21/compare-two-string-literals/</link>
		<comments>http://algorithmfun.wordpress.com/2010/06/21/compare-two-string-literals/#comments</comments>
		<pubDate>Mon, 21 Jun 2010 18:51:32 +0000</pubDate>
		<dc:creator>Sandeep Phukan</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Java]]></category>
		<category><![CDATA[Recursion]]></category>
		<category><![CDATA[Strings]]></category>
		<category><![CDATA[text handling]]></category>

		<guid isPermaLink="false">http://algorithmfun.wordpress.com/?p=50</guid>
		<description><![CDATA[Compare two string literals<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=algorithmfun.wordpress.com&amp;blog=2436670&amp;post=50&amp;subd=algorithmfun&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://algorithmfun.wordpress.com/2010/06/21/compare-two-string-literals/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/af212ec63c07eac26ccb9284e3e4667a?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">middleware</media:title>
		</media:content>
	</item>
	</channel>
</rss>
