<?xml version="1.0" encoding="UTF-8"?><rss version="0.92">
<channel>
	<title>Stupid Code For Indian College Students</title>
	<link>http://code.rutsum.com</link>
	<description>Trivial C, C++ Programs.</description>
	<lastBuildDate>Mon, 12 Apr 2010 03:48:30 +0000</lastBuildDate>
	<docs>http://backend.userland.com/rss092</docs>
	<language>en</language>
	

	<item>
		<title>Merge Sort in C++</title>
		<description><![CDATA[Been a while since I posted some code here, this one I&#8217;m posting to help a junior from NSIT out. &#160; #include &#60;iostream.h&#62; &#160; &#160; int *Arr, maxSize; &#160; void createArr&#40;&#41; &#123; cout&#60;&#60;&#34;\n\n Enter the maximum size of array : &#34;; cin&#62;&#62;maxSize; Arr = new int&#91;maxSize&#93;; &#125; &#160; void fillArr&#40;&#41; &#123; cout&#60;&#60;&#34;\n\n Enter the elements [...]]]></description>
		<link>http://code.rutsum.com/merge-sort-in-c/</link>
			</item>
	<item>
		<title>Queues Using Linked Lists in C++</title>
		<description><![CDATA[And NO, there is no meaning to adding a special operation called &#8216;Create&#8217; the queue. When you push in the first element, the queue is created. Of course I didn&#8217;t bother to check for exceptions. This is a straight off the text book program, suck on it bitches. &#160; #include&#60;iostream.h&#62; #include&#60;conio.h&#62; &#160; struct node &#123; [...]]]></description>
		<link>http://code.rutsum.com/queues-using-linked-lists-in-c/</link>
			</item>
	<item>
		<title>Queues Using Arrays (Static) in C++</title>
		<description><![CDATA[It does what it says. A first-in first-out structure, implement in the simplest possible way. Again, no bound checks. Sanitize your inputs please. #include &#60;iostream.h&#62; &#160; int *Queue, front, rear, maxSize; &#160; void createQueue&#40;&#41;; void push&#40;&#41;; void pop&#40;&#41;; void dispQueue&#40;&#41;; &#160; int main&#40;&#41; &#123; int choice; while&#40;choice != 5&#41; &#123; cout&#60;&#60;&#34;\n\n Enter your choice :&#34; [...]]]></description>
		<link>http://code.rutsum.com/queues-using-arrays-static-in-c/</link>
			</item>
	<item>
		<title>Stacks Using Arrays (Static) in C++</title>
		<description><![CDATA[This is a general implementation of the stack data structure in C++. I&#8217;ve made it a &#8216;menu-driven&#8217; program, for all you menu-loving whores. Nobody cares if it is rendered unreadable. Also, I&#8217;ve skipped bound checks in this program, so remember to sanitize your inputs or you may get sucked into a vortex. Also, since I&#8217;m [...]]]></description>
		<link>http://code.rutsum.com/stacks-using-arrays/</link>
			</item>
	<item>
		<title>Fibonacci Series (Using Recursion) in C++</title>
		<description><![CDATA[This is a simple 2 statement function that takes n as an argument and returns the nth Fibonacci number. Can be used to display the Fibonacci series upto the integer size limit. &#160; #include &#60;iostream.h&#62; #include &#60;conio.h&#62; &#160; unsigned int fibonacci &#40;unsigned int n&#41; &#123; if &#40;n &#60;= 2&#41; &#123; return 1; &#125; else &#123; [...]]]></description>
		<link>http://code.rutsum.com/fibonacci-series-using-recursion/</link>
			</item>
	<item>
		<title>Linear Search in C++</title>
		<description><![CDATA[Oh yeah, they ask us to make Linear Search TOO. This code is as simple as it gets. Sorry, but making it any simpler would make my eyes bleed. Here you go. &#160; #include &#60;iostream.h&#62; #include &#60;conio.h&#62; &#160; int linearSearch&#40;int*, int, int, int&#41;; &#160; int main&#40;&#41; &#123; int *sArray, mSize, i, elem, index; &#160; cout&#60;&#60;&#34;\n [...]]]></description>
		<link>http://code.rutsum.com/linear-search/</link>
			</item>
	<item>
		<title>Binary Search in C++</title>
		<description><![CDATA[Now the important thing to note here is that Binary Search only has a meaning when your input is sorted in some way, using some parameter as basis for sorting. This program implements binary search for a set of integers, sorted in ascending order. Binary search on an unsorted input makes no sense as if [...]]]></description>
		<link>http://code.rutsum.com/binary-search/</link>
			</item>
</channel>
</rss>

