<?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>AtomicPages Blog</title>
	<atom:link href="http://www.atomicpages.net/blog/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.atomicpages.net/blog</link>
	<description>Web Hosting, Design, and Development</description>
	<lastBuildDate>Sun, 09 Jun 2013 08:07:02 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.5.1</generator>
		<item>
		<title>Skeleton SASS</title>
		<link>http://www.atomicpages.net/blog/2013/03/17/skeleton-sass/</link>
		<comments>http://www.atomicpages.net/blog/2013/03/17/skeleton-sass/#comments</comments>
		<pubDate>Sun, 17 Mar 2013 22:38:14 +0000</pubDate>
		<dc:creator>Dennis Thompson</dc:creator>
				<category><![CDATA[SASS]]></category>

		<guid isPermaLink="false">http://www.atomicpages.net/blog/?p=4698</guid>
		<description><![CDATA[Download
View Source on Github

For all the SASS lovers out there, we have converted a Dave Gamache's Skeleton CSS into SASS! The official repository can be found here: https://github.com/atomicpages/skeleton-sass.
Features

SASS + Compass translation
SASS translation
.scss and .sass files
A demo  [...]]]></description>
		<wfw:commentRss>http://www.atomicpages.net/blog/2013/03/17/skeleton-sass/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Intro to SASS - Nesting and Selector Inheritance</title>
		<link>http://www.atomicpages.net/blog/2013/02/18/intro-to-sass-nesting-and-selector-inheritance/</link>
		<comments>http://www.atomicpages.net/blog/2013/02/18/intro-to-sass-nesting-and-selector-inheritance/#comments</comments>
		<pubDate>Mon, 18 Feb 2013 15:00:41 +0000</pubDate>
		<dc:creator>Dennis Thompson</dc:creator>
				<category><![CDATA[SASS]]></category>
		<category><![CDATA[learn SASS]]></category>
		<category><![CDATA[learn SASS online]]></category>
		<category><![CDATA[SASS tutorial]]></category>
		<category><![CDATA[SASS tutorial online]]></category>

		<guid isPermaLink="false">http://www.atomicpages.net/blog/?p=4526</guid>
		<description><![CDATA[SASS is a way to create dynamic styles that render into CSS. SASS is a better way to write and manage styles because of nesting and selector inheritance. Without further ado, let's learn more about SASS!
Nesting in SASS
Nesting selectors in SASS provides a more organized approach to writing styles.  [...]]]></description>
		<wfw:commentRss>http://www.atomicpages.net/blog/2013/02/18/intro-to-sass-nesting-and-selector-inheritance/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Bitwise Algorithm 4: Find Odd Singleton</title>
		<link>http://www.atomicpages.net/blog/2013/01/14/bitwise-algorithm-4-find-odd-singleton/</link>
		<comments>http://www.atomicpages.net/blog/2013/01/14/bitwise-algorithm-4-find-odd-singleton/#comments</comments>
		<pubDate>Mon, 14 Jan 2013 15:00:53 +0000</pubDate>
		<dc:creator>Jackson Hines</dc:creator>
				<category><![CDATA[Algorithms]]></category>

		<guid isPermaLink="false">http://www.atomicpages.net/blog/?p=4596</guid>
		<description><![CDATA[Problem
Given an array of integers, in which all values occur an even number of times except for one which occurs an odd number of times.  Find the integer that occurs an odd number of times.
For example, given this array: 4, 5, 7, 3, 4, 4, 4, 7, 3, 5, 7.  The number 7 occurs an odd number of times  [...]]]></description>
		<wfw:commentRss>http://www.atomicpages.net/blog/2013/01/14/bitwise-algorithm-4-find-odd-singleton/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Bitwise Algorithm 3: Count Bits</title>
		<link>http://www.atomicpages.net/blog/2013/01/11/bitwise-algorithm-3-count-bits/</link>
		<comments>http://www.atomicpages.net/blog/2013/01/11/bitwise-algorithm-3-count-bits/#comments</comments>
		<pubDate>Fri, 11 Jan 2013 15:00:34 +0000</pubDate>
		<dc:creator>Jackson Hines</dc:creator>
				<category><![CDATA[Algorithms]]></category>

		<guid isPermaLink="false">http://www.atomicpages.net/blog/?p=4595</guid>
		<description><![CDATA[Problem
Count the number of 1s in the bit representation of the given integer.
For example, given the number 6, the bit representation is 0110, which contains two 1s, so the answer is 2.
Algorithm
In the previous tutorial we learned how to clear the lowest bit of a number.  We can use that  [...]]]></description>
		<wfw:commentRss>http://www.atomicpages.net/blog/2013/01/11/bitwise-algorithm-3-count-bits/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Bitwise Algorithm 2: Clear Lowest Bit</title>
		<link>http://www.atomicpages.net/blog/2013/01/10/bitwise-algorithm-2-clear-lowest-bit/</link>
		<comments>http://www.atomicpages.net/blog/2013/01/10/bitwise-algorithm-2-clear-lowest-bit/#comments</comments>
		<pubDate>Thu, 10 Jan 2013 15:00:13 +0000</pubDate>
		<dc:creator>Jackson Hines</dc:creator>
				<category><![CDATA[Algorithms]]></category>

		<guid isPermaLink="false">http://www.atomicpages.net/blog/?p=4593</guid>
		<description><![CDATA[Problem
Clear the rightmost set bit in the given integer.
For example, given the number 5, the bit pattern is 0101.  Clearing the right most set bit we get 0100, which is 4.  Given the number 8, the bit pattern is 1000, clearing the right most set bit we get 0.
Algorithm
The algorithm is simple.   [...]]]></description>
		<wfw:commentRss>http://www.atomicpages.net/blog/2013/01/10/bitwise-algorithm-2-clear-lowest-bit/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Bitwise Algorithm 1: Clear Bit</title>
		<link>http://www.atomicpages.net/blog/2013/01/09/bitwise-algorithm-1-clear-bit/</link>
		<comments>http://www.atomicpages.net/blog/2013/01/09/bitwise-algorithm-1-clear-bit/#comments</comments>
		<pubDate>Wed, 09 Jan 2013 15:00:30 +0000</pubDate>
		<dc:creator>Jackson Hines</dc:creator>
				<category><![CDATA[Algorithms]]></category>

		<guid isPermaLink="false">http://www.atomicpages.net/blog/?p=4590</guid>
		<description><![CDATA[Problem
Given an integer x, clear the kth bit from the right (the rightmost bit is the 0th bit).
For example, let's say x = 000100101110.  Here the 1st, 2nd, 3rd, 5th, and 8th bit are set.  So for k=1, the algorithm should return 00100101100, but for k=0, since the 0th bit is already clear, it  [...]]]></description>
		<wfw:commentRss>http://www.atomicpages.net/blog/2013/01/09/bitwise-algorithm-1-clear-bit/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Interesting Programming Puzzle</title>
		<link>http://www.atomicpages.net/blog/2013/01/08/interesting-programming-puzzle/</link>
		<comments>http://www.atomicpages.net/blog/2013/01/08/interesting-programming-puzzle/#comments</comments>
		<pubDate>Tue, 08 Jan 2013 15:00:21 +0000</pubDate>
		<dc:creator>Jackson Hines</dc:creator>
				<category><![CDATA[Algorithms]]></category>

		<guid isPermaLink="false">http://www.atomicpages.net/blog/?p=4580</guid>
		<description><![CDATA[How many ways can you write a function such that f(1) = 2 and f(2) = 1.  It doesn't matter what the function returns for other values.  Here are the functions I came up with in c.
Using control flow:
Using bitwise xor:
Using subtraction:
Using modulus:
Using an array:
Using logical not:
Can anyone  [...]]]></description>
		<wfw:commentRss>http://www.atomicpages.net/blog/2013/01/08/interesting-programming-puzzle/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Maximum Single Buy and Sell Profit Problem</title>
		<link>http://www.atomicpages.net/blog/2013/01/07/maximum-single-buy-and-sell-profit-problem/</link>
		<comments>http://www.atomicpages.net/blog/2013/01/07/maximum-single-buy-and-sell-profit-problem/#comments</comments>
		<pubDate>Mon, 07 Jan 2013 15:00:39 +0000</pubDate>
		<dc:creator>Jackson Hines</dc:creator>
				<category><![CDATA[Algorithms]]></category>

		<guid isPermaLink="false">http://www.atomicpages.net/blog/?p=4561</guid>
		<description><![CDATA[Heres a pretty simple but interesting problem to solve.  Also a popular interview question!
Problem
Given a list of stock prices for a specific stock over time in chronological order, figure out what is the maximum profit that could have been made by making exactly one buy and one sell of this  [...]]]></description>
		<wfw:commentRss>http://www.atomicpages.net/blog/2013/01/07/maximum-single-buy-and-sell-profit-problem/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>The Maximum Sum Problem</title>
		<link>http://www.atomicpages.net/blog/2013/01/06/the-maximum-sum-problem/</link>
		<comments>http://www.atomicpages.net/blog/2013/01/06/the-maximum-sum-problem/#comments</comments>
		<pubDate>Sun, 06 Jan 2013 10:32:53 +0000</pubDate>
		<dc:creator>Jackson Hines</dc:creator>
				<category><![CDATA[Algorithms]]></category>

		<guid isPermaLink="false">http://www.atomicpages.net/blog/?p=4319</guid>
		<description><![CDATA[Recently I have been solving algorithms problems for fun and thought it'd be a good idea to share some of my solutions here. So here's one called the Maxmimum Sum Problem.
Problem
Given an n * n matrix of integers, find the sum of sub-rectangular (doesn't have to be a square) matrix with the  [...]]]></description>
		<wfw:commentRss>http://www.atomicpages.net/blog/2013/01/06/the-maximum-sum-problem/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Intro to SASS - Variables and Mixins</title>
		<link>http://www.atomicpages.net/blog/2013/01/04/intro-to-sass-variables-and-mixins/</link>
		<comments>http://www.atomicpages.net/blog/2013/01/04/intro-to-sass-variables-and-mixins/#comments</comments>
		<pubDate>Sat, 05 Jan 2013 02:32:56 +0000</pubDate>
		<dc:creator>Dennis Thompson</dc:creator>
				<category><![CDATA[SASS]]></category>
		<category><![CDATA[learn SASS]]></category>
		<category><![CDATA[learn SASS online]]></category>
		<category><![CDATA[SASS tutorial]]></category>
		<category><![CDATA[SASS tutorial online]]></category>

		<guid isPermaLink="false">http://www.atomicpages.net/blog/?p=4458</guid>
		<description><![CDATA[This tutorial is split into two sections. The first section which can be found here is for the non-programmers or those who are new to programming languages such as JavaScript, PHP, Python, and/or Ruby and have little to no experience dealing with logic, arrays, or functions. For those who have  [...]]]></description>
		<wfw:commentRss>http://www.atomicpages.net/blog/2013/01/04/intro-to-sass-variables-and-mixins/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
