<?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>GeeksforGeeks</title>
	<atom:link href="http://www.geeksforgeeks.org/feed" rel="self" type="application/rss+xml" />
	<link>http://www.geeksforgeeks.org</link>
	<description>A computer science portal for geeks</description>
	<lastBuildDate>Mon, 20 Feb 2012 03:33:36 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
		<item>
		<title>Output of C Program &#124; Set 26</title>
		<link>http://www.geeksforgeeks.org/archives/17393?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=output-of-c-program-set-26</link>
		<comments>http://www.geeksforgeeks.org/archives/17393#comments</comments>
		<pubDate>Mon, 20 Feb 2012 03:33:36 +0000</pubDate>
		<dc:creator>GeeksforGeeks</dc:creator>
				<category><![CDATA[Output]]></category>

		<guid isPermaLink="false">http://www.geeksforgeeks.org/?p=17393</guid>
		<description><![CDATA[Predict the output of following C programs. Question 1 Output: 0 C (or C++) allows arrays of size 0. When an array is declared with empty initialization list, size of the array becomes 0. Question 2 Output: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 1 5 [...]]]></description>
		<wfw:commentRss>http://www.geeksforgeeks.org/archives/17393/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Analysis of Algorithms &#124; Set 2 (Worst, Average and Best Cases)</title>
		<link>http://www.geeksforgeeks.org/archives/17020?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=analysis-of-algorithms-set-2-asymptotic-analysis</link>
		<comments>http://www.geeksforgeeks.org/archives/17020#comments</comments>
		<pubDate>Sun, 19 Feb 2012 03:38:02 +0000</pubDate>
		<dc:creator>GeeksforGeeks</dc:creator>
				<category><![CDATA[Misc]]></category>

		<guid isPermaLink="false">http://www.geeksforgeeks.org/?p=17020</guid>
		<description><![CDATA[In the previous post, we discussed how Asymptotic analysis overcomes the problems of naive way of analyzing algorithms. In this post, we will take an example of Linear Search and analyze it using Asymptotic analysis. We can have three cases to analyze an algorithm: 1) Worst Case 2) Average Case 3) Best Case Let us [...]]]></description>
		<wfw:commentRss>http://www.geeksforgeeks.org/archives/17020/feed</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Find the largest BST subtree in a given Binary Tree</title>
		<link>http://www.geeksforgeeks.org/archives/7291?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=find-the-largest-subtree-in-a-tree-that-is-also-a-bst</link>
		<comments>http://www.geeksforgeeks.org/archives/7291#comments</comments>
		<pubDate>Fri, 17 Feb 2012 06:40:41 +0000</pubDate>
		<dc:creator>GeeksforGeeks</dc:creator>
				<category><![CDATA[Trees]]></category>

		<guid isPermaLink="false">http://geeksforgeeks.org/?p=7291</guid>
		<description><![CDATA[Given a Binary Tree, write a function that returns the size of the largest subtree which is also a Binary Search Tree (BST). If the complete Binary Tree is BST, then return the size of whole tree. Examples: Input: 5 / \ 2 4 / \ 1 3 Output: 3 The following subtree is the [...]]]></description>
		<wfw:commentRss>http://www.geeksforgeeks.org/archives/7291/feed</wfw:commentRss>
		<slash:comments>11</slash:comments>
		</item>
		<item>
		<title>Complicated declarations in C</title>
		<link>http://www.geeksforgeeks.org/archives/16841?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=complicated-declarations-in-c</link>
		<comments>http://www.geeksforgeeks.org/archives/16841#comments</comments>
		<pubDate>Tue, 14 Feb 2012 15:20:40 +0000</pubDate>
		<dc:creator>GeeksforGeeks</dc:creator>
				<category><![CDATA[C/C++ Puzzles]]></category>

		<guid isPermaLink="false">http://www.geeksforgeeks.org/?p=16841</guid>
		<description><![CDATA[Most of the times declarations are simple to read, but it is hard to read some declarations which involve pointer to functions. For example, consider the following declaration from &#8220;signal.h&#8221;. Let us see the steps to read complicated declarations. 1) Convert C declaration to postfix format and read from left to right. 2) To convert [...]]]></description>
		<wfw:commentRss>http://www.geeksforgeeks.org/archives/16841/feed</wfw:commentRss>
		<slash:comments>7</slash:comments>
		</item>
		<item>
		<title>Convert a given tree to Sum Tree</title>
		<link>http://www.geeksforgeeks.org/archives/17855?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=convert-a-given-tree-to-sum-tree</link>
		<comments>http://www.geeksforgeeks.org/archives/17855#comments</comments>
		<pubDate>Sun, 12 Feb 2012 18:00:19 +0000</pubDate>
		<dc:creator>GeeksforGeeks</dc:creator>
				<category><![CDATA[Trees]]></category>

		<guid isPermaLink="false">http://www.geeksforgeeks.org/?p=17855</guid>
		<description><![CDATA[Given a Binary Tree where each node has positive and negative values. Convert this to a tree where each node contains the sum of the left and right sub trees in the original tree. The values of leaf nodes are changed to 0. For example, the following tree 10 / \ -2 6 / \ [...]]]></description>
		<wfw:commentRss>http://www.geeksforgeeks.org/archives/17855/feed</wfw:commentRss>
		<slash:comments>7</slash:comments>
		</item>
		<item>
		<title>Dynamic Programming &#124; Set 9 (Binomial Coefficient)</title>
		<link>http://www.geeksforgeeks.org/archives/17806?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=dynamic-programming-set-9-binomial-coefficient</link>
		<comments>http://www.geeksforgeeks.org/archives/17806#comments</comments>
		<pubDate>Sat, 11 Feb 2012 10:28:27 +0000</pubDate>
		<dc:creator>GeeksforGeeks</dc:creator>
				<category><![CDATA[Misc]]></category>
		<category><![CDATA[Dynamic Programming]]></category>

		<guid isPermaLink="false">http://www.geeksforgeeks.org/?p=17806</guid>
		<description><![CDATA[Following are common definition of Binomial Coefficients. 1) A binomial coefficient C(n, k) can be defined as the coefficient of X^k in the expansion of (1 + X)^n. 2) A binomial coefficient C(n, k) also gives the number of ways, disregarding order, that k objects can be chosen from among n objects; more formally, the [...]]]></description>
		<wfw:commentRss>http://www.geeksforgeeks.org/archives/17806/feed</wfw:commentRss>
		<slash:comments>10</slash:comments>
		</item>
		<item>
		<title>Check whether a given string is an interleaving of two other given strings</title>
		<link>http://www.geeksforgeeks.org/archives/17750?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=check-whether-a-given-string-is-an-interleaving-of-two-other-given-strings</link>
		<comments>http://www.geeksforgeeks.org/archives/17750#comments</comments>
		<pubDate>Fri, 10 Feb 2012 03:58:15 +0000</pubDate>
		<dc:creator>GeeksforGeeks</dc:creator>
				<category><![CDATA[Strings]]></category>

		<guid isPermaLink="false">http://www.geeksforgeeks.org/?p=17750</guid>
		<description><![CDATA[Given three strings A, B and C. Write a function that checks whether C is an interleaving of A and B. C is said to be interleaving A and B, if it contains all characters of A and B and order of all characters in individual strings is preserved. See previous post for examples. Solution: [...]]]></description>
		<wfw:commentRss>http://www.geeksforgeeks.org/archives/17750/feed</wfw:commentRss>
		<slash:comments>12</slash:comments>
		</item>
		<item>
		<title>Print all interleavings of given two strings</title>
		<link>http://www.geeksforgeeks.org/archives/17743?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=print-all-interleavings-of-given-two-strings</link>
		<comments>http://www.geeksforgeeks.org/archives/17743#comments</comments>
		<pubDate>Thu, 09 Feb 2012 09:40:55 +0000</pubDate>
		<dc:creator>GeeksforGeeks</dc:creator>
				<category><![CDATA[Strings]]></category>

		<guid isPermaLink="false">http://www.geeksforgeeks.org/?p=17743</guid>
		<description><![CDATA[Given two strings str1 and str2, write a function that prints all interleavings of the given two strings. You may assume that all characters in both strings are different Example: Input: str1 = "AB", str2 = "CD" Output: ABCD ACBD ACDB CABD CADB CDAB Input: str1 = "AB", str2 = "C" Output: ABC ACB CAB [...]]]></description>
		<wfw:commentRss>http://www.geeksforgeeks.org/archives/17743/feed</wfw:commentRss>
		<slash:comments>13</slash:comments>
		</item>
		<item>
		<title>Print all permutations with repetition of characters</title>
		<link>http://www.geeksforgeeks.org/archives/17653?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=print-all-permutations-with-repetition-of-characters</link>
		<comments>http://www.geeksforgeeks.org/archives/17653#comments</comments>
		<pubDate>Wed, 08 Feb 2012 04:52:35 +0000</pubDate>
		<dc:creator>GeeksforGeeks</dc:creator>
				<category><![CDATA[Misc]]></category>

		<guid isPermaLink="false">http://www.geeksforgeeks.org/?p=17653</guid>
		<description><![CDATA[Given a string of length n, print all permutation of the given string. Repetition of characters is allowed. Print these permutations in lexicographically sorted order Examples: Input: AB Ouput: All permutations of AB with repetition are: AA AB BA BB Input: ABC Output: All permutations of ABC with repetition are: AAA AAB AAC ABA ... [...]]]></description>
		<wfw:commentRss>http://www.geeksforgeeks.org/archives/17653/feed</wfw:commentRss>
		<slash:comments>4</slash:comments>
		</item>
		<item>
		<title>In-place conversion of Sorted DLL to Balanced BST</title>
		<link>http://www.geeksforgeeks.org/archives/17629?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=in-place-conversion-of-sorted-dll-to-balanced-bst</link>
		<comments>http://www.geeksforgeeks.org/archives/17629#comments</comments>
		<pubDate>Fri, 03 Feb 2012 06:55:58 +0000</pubDate>
		<dc:creator>GeeksforGeeks</dc:creator>
				<category><![CDATA[Linked Lists]]></category>

		<guid isPermaLink="false">http://www.geeksforgeeks.org/?p=17629</guid>
		<description><![CDATA[Given a Doubly Linked List which has data members sorted in ascending order. Construct a Balanced Binary Search Tree which has same data members as the given Doubly Linked List. The tree must be constructed in-place (No new node should be allocated for tree conversion) Examples: Input: Doubly Linked List 1 2 3 Output: A [...]]]></description>
		<wfw:commentRss>http://www.geeksforgeeks.org/archives/17629/feed</wfw:commentRss>
		<slash:comments>12</slash:comments>
		</item>
		<item>
		<title>Dynamic Programming &#124; Set 8 (Matrix Chain Multiplication)</title>
		<link>http://www.geeksforgeeks.org/archives/15553?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=dynamic-programming-set-8-matrix-chain-multiplication</link>
		<comments>http://www.geeksforgeeks.org/archives/15553#comments</comments>
		<pubDate>Thu, 02 Feb 2012 09:45:31 +0000</pubDate>
		<dc:creator>GeeksforGeeks</dc:creator>
				<category><![CDATA[Misc]]></category>
		<category><![CDATA[Dynamic Programming]]></category>

		<guid isPermaLink="false">http://www.geeksforgeeks.org/?p=15553</guid>
		<description><![CDATA[Given a sequence of matrices, find the most efficient way to multiply these matrices together. The problem is not actually to perform the multiplications, but merely to decide in which order to perform the multiplications. We have many options to multiply a chain of matrices because matrix multiplication is associative. In other words, no matter [...]]]></description>
		<wfw:commentRss>http://www.geeksforgeeks.org/archives/15553/feed</wfw:commentRss>
		<slash:comments>6</slash:comments>
		</item>
		<item>
		<title>Dynamic Programming &#124; Set 7 (Coin Change)</title>
		<link>http://www.geeksforgeeks.org/archives/17401?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=dynamic-programming-set-7-coin-change</link>
		<comments>http://www.geeksforgeeks.org/archives/17401#comments</comments>
		<pubDate>Sun, 29 Jan 2012 17:09:18 +0000</pubDate>
		<dc:creator>GeeksforGeeks</dc:creator>
				<category><![CDATA[Misc]]></category>
		<category><![CDATA[Dynamic Programming]]></category>

		<guid isPermaLink="false">http://www.geeksforgeeks.org/?p=17401</guid>
		<description><![CDATA[Given a value N, if we want to make change for N cents, and we have infinite supply of each of S = { S1, S2, .. , Sm} valued coins, how many ways can we make the change? The order of coins doesn&#8217;t matter. For example, for N = 4 and S = {1,2,3}, [...]]]></description>
		<wfw:commentRss>http://www.geeksforgeeks.org/archives/17401/feed</wfw:commentRss>
		<slash:comments>8</slash:comments>
		</item>
		<item>
		<title>Populate Inorder Successor for all nodes</title>
		<link>http://www.geeksforgeeks.org/archives/17358?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=populate-inorder-successor-for-all-nodes</link>
		<comments>http://www.geeksforgeeks.org/archives/17358#comments</comments>
		<pubDate>Thu, 26 Jan 2012 15:00:20 +0000</pubDate>
		<dc:creator>GeeksforGeeks</dc:creator>
				<category><![CDATA[Trees]]></category>

		<guid isPermaLink="false">http://www.geeksforgeeks.org/?p=17358</guid>
		<description><![CDATA[Given a Binary Tree where each node has following structure, write a function to populate next pointer for all nodes. The next pointer for every node should be set to point to inorder successor. Initially, all next pointers have NULL values. Your function should fill these next pointers so that they point to inorder successor. [...]]]></description>
		<wfw:commentRss>http://www.geeksforgeeks.org/archives/17358/feed</wfw:commentRss>
		<slash:comments>7</slash:comments>
		</item>
	</channel>
</rss>

<!-- Dynamic page generated in 4.008 seconds. -->
<!-- Cached page generated by WP-Super-Cache on 2012-02-22 21:57:07 -->

