<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="wordpress.com" -->
<urlset xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.sitemaps.org/schemas/sitemap/0.9 http://www.sitemaps.org/schemas/sitemap/0.9/sitemap.xsd" xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
		<url>
			<loc>http://tekpool.wordpress.com/about/</loc>
			<lastmod>2006-09-21T01:08:47+00:00</lastmod>
			<changefreq>weekly</changefreq>
			<priority>0.6</priority>
		</url>
		<url>
			<loc>http://tekpool.wordpress.com/2007/01/10/const-correctness-difference-between-foo-const-ptr-const-foo-ptr-const-foo-const-ptr/</loc>
			<lastmod>2007-01-10T09:49:35+00:00</lastmod>
			<changefreq>weekly</changefreq>
			<priority>0.6</priority>
		</url>
		<url>
			<loc>http://tekpool.wordpress.com/2006/12/22/constructors-copy-constructors-what-why-how-when-c/</loc>
			<lastmod>2006-12-22T13:00:20+00:00</lastmod>
			<changefreq>weekly</changefreq>
			<priority>0.6</priority>
		</url>
		<url>
			<loc>http://tekpool.wordpress.com/2006/12/08/constructors-error-exception-handling-in-constructors/</loc>
			<lastmod>2006-12-08T03:44:42+00:00</lastmod>
			<changefreq>weekly</changefreq>
			<priority>0.6</priority>
		</url>
		<url>
			<loc>http://tekpool.wordpress.com/2006/12/03/swapping-variables-without-additional-space/</loc>
			<lastmod>2006-12-03T23:47:32+00:00</lastmod>
			<changefreq>weekly</changefreq>
			<priority>0.6</priority>
		</url>
		<url>
			<loc>http://tekpool.wordpress.com/2006/11/27/singleton-pattern-part-3-double-checked-locking/</loc>
			<lastmod>2006-11-27T08:35:29+00:00</lastmod>
			<changefreq>weekly</changefreq>
			<priority>0.6</priority>
		</url>
		<url>
			<loc>http://tekpool.wordpress.com/2006/11/16/binary-tree-searching-improving-search-performance-with-sentinels/</loc>
			<lastmod>2006-12-03T23:44:36+00:00</lastmod>
			<changefreq>weekly</changefreq>
			<priority>0.6</priority>
		</url>
		<url>
			<loc>http://tekpool.wordpress.com/2006/11/04/binary-tree-traversal-breadth-first-aka-width-first-aka-level-order/</loc>
			<lastmod>2006-11-04T00:34:54+00:00</lastmod>
			<changefreq>weekly</changefreq>
			<priority>0.6</priority>
		</url>
		<url>
			<loc>http://tekpool.wordpress.com/2006/10/12/rectangle-intersection-find-the-intersecting-rectangle/</loc>
			<lastmod>2006-10-12T09:58:24+00:00</lastmod>
			<changefreq>weekly</changefreq>
			<priority>0.6</priority>
		</url>
		<url>
			<loc>http://tekpool.wordpress.com/2006/10/27/singleton-pattern-part-2-thread-safe-implemenation/</loc>
			<lastmod>2006-10-27T20:56:52+00:00</lastmod>
			<changefreq>weekly</changefreq>
			<priority>0.6</priority>
		</url>
		<url>
			<loc>http://tekpool.wordpress.com/2006/10/19/singleton-pattern-part-1-trivial-implemenation/</loc>
			<lastmod>2006-10-19T17:08:37+00:00</lastmod>
			<changefreq>weekly</changefreq>
			<priority>0.6</priority>
		</url>
		<url>
			<loc>http://tekpool.wordpress.com/2006/10/15/string-pattern-matching-write-a-function-that-checks-for-a-given-pattern-at-the-end-of-a-given-string/</loc>
			<lastmod>2006-10-15T01:13:04+00:00</lastmod>
			<changefreq>weekly</changefreq>
			<priority>0.6</priority>
		</url>
		<url>
			<loc>http://tekpool.wordpress.com/2006/10/11/rectangle-intersection-determine-if-two-given-rectangles-intersect-each-other-or-not/</loc>
			<lastmod>2006-10-11T06:34:49+00:00</lastmod>
			<changefreq>weekly</changefreq>
			<priority>0.6</priority>
		</url>
		<url>
			<loc>http://tekpool.wordpress.com/2006/10/06/shuffling-shuffle-a-deck-of-cards-knuth-shuffle/</loc>
			<lastmod>2006-10-06T16:25:45+00:00</lastmod>
			<changefreq>weekly</changefreq>
			<priority>0.6</priority>
		</url>
		<url>
			<loc>http://tekpool.wordpress.com/2006/10/06/prime-numbers-finding-the-first-n-primes-part-4-sieve-of-eratosthenes-and-erdos-prime-number-theorm/</loc>
			<lastmod>2006-10-06T05:11:15+00:00</lastmod>
			<changefreq>weekly</changefreq>
			<priority>0.6</priority>
		</url>
		<url>
			<loc>http://tekpool.wordpress.com/2006/10/04/prime-numbers-finding-the-first-n-primes-part-3-prime-divisors/</loc>
			<lastmod>2006-10-04T20:24:26+00:00</lastmod>
			<changefreq>weekly</changefreq>
			<priority>0.6</priority>
		</url>
		<url>
			<loc>http://tekpool.wordpress.com/2006/10/04/prime-numbers-finding-the-first-n-primes-part-2-skipping-multiples/</loc>
			<lastmod>2006-10-04T03:04:32+00:00</lastmod>
			<changefreq>weekly</changefreq>
			<priority>0.6</priority>
		</url>
		<url>
			<loc>http://tekpool.wordpress.com/2006/10/02/prime-numbers-finding-the-first-n-primes-part-1-trivial-approaches/</loc>
			<lastmod>2006-10-02T16:42:41+00:00</lastmod>
			<changefreq>weekly</changefreq>
			<priority>0.6</priority>
		</url>
		<url>
			<loc>http://tekpool.wordpress.com/2006/09/29/linked-list-detect-a-cycle-in-a-linked-list-and-fix-the-cycle/</loc>
			<lastmod>2006-09-29T20:29:26+00:00</lastmod>
			<changefreq>weekly</changefreq>
			<priority>0.6</priority>
		</url>
		<url>
			<loc>http://tekpool.wordpress.com/2006/09/29/linked-list-detect-a-cycle-in-a-linked-list-list-reversal/</loc>
			<lastmod>2006-09-29T02:22:31+00:00</lastmod>
			<changefreq>weekly</changefreq>
			<priority>0.6</priority>
		</url>
		<url>
			<loc>http://tekpool.wordpress.com/2006/09/28/linked-list-detect-a-cycle-in-a-linked-list-two-pointers-approach-faster/</loc>
			<lastmod>2006-09-28T07:16:09+00:00</lastmod>
			<changefreq>weekly</changefreq>
			<priority>0.6</priority>
		</url>
		<url>
			<loc>http://tekpool.wordpress.com/2006/09/27/linked-list-detect-a-cycle-in-a-linked-list-two-pointers-approach-slow/</loc>
			<lastmod>2006-09-27T19:39:22+00:00</lastmod>
			<changefreq>weekly</changefreq>
			<priority>0.6</priority>
		</url>
		<url>
			<loc>http://tekpool.wordpress.com/2006/09/26/linked-list-detect-a-cycle-in-a-linked-list-trival-approaches/</loc>
			<lastmod>2006-09-26T21:15:07+00:00</lastmod>
			<changefreq>weekly</changefreq>
			<priority>0.6</priority>
		</url>
		<url>
			<loc>http://tekpool.wordpress.com/2006/09/25/bit-count-parallel-counting-mit-hakmem/</loc>
			<lastmod>2006-09-25T18:23:45+00:00</lastmod>
			<changefreq>weekly</changefreq>
			<priority>0.6</priority>
		</url>
		<url>
			<loc>http://tekpool.wordpress.com/2006/09/24/bit-count-unset-bit-iterator/</loc>
			<lastmod>2006-09-24T20:22:03+00:00</lastmod>
			<changefreq>weekly</changefreq>
			<priority>0.6</priority>
		</url>
		<url>
			<loc>http://tekpool.wordpress.com/2006/09/24/bit-count-set-bit-iterator/</loc>
			<lastmod>2006-09-24T07:06:30+00:00</lastmod>
			<changefreq>weekly</changefreq>
			<priority>0.6</priority>
		</url>
		<url>
			<loc>http://tekpool.wordpress.com/2006/09/22/bit-count-looping-through-the-bits/</loc>
			<lastmod>2006-09-22T04:59:59+00:00</lastmod>
			<changefreq>weekly</changefreq>
			<priority>0.6</priority>
		</url>
		<url>
			<loc>http://tekpool.wordpress.com/2006/09/21/bit-count-pre-computing-bits/</loc>
			<lastmod>2006-09-21T08:08:52+00:00</lastmod>
			<changefreq>weekly</changefreq>
			<priority>0.6</priority>
		</url>
		<url>
			<loc>http://tekpool.wordpress.com/</loc>
			<lastmod>2007-01-10T09:49:35+00:00</lastmod>
			<changefreq>daily</changefreq>
			<priority>1.0</priority>
		</url>
</urlset>
