<?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>coretan si cuplis &#187; Algoritma</title>
	<atom:link href="http://cuplis.net/tag/algoritma/feed/" rel="self" type="application/rss+xml" />
	<link>http://cuplis.net</link>
	<description>learn the way, define your own way</description>
	<lastBuildDate>Sun, 15 Jan 2012 14:23:29 +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>sudoku android sukses</title>
		<link>http://cuplis.net/2011/04/23/sudoku-android-sukses/</link>
		<comments>http://cuplis.net/2011/04/23/sudoku-android-sukses/#comments</comments>
		<pubDate>Sat, 23 Apr 2011 08:00:58 +0000</pubDate>
		<dc:creator>cuplis</dc:creator>
				<category><![CDATA[Blog]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[Algoritma]]></category>
		<category><![CDATA[Android]]></category>
		<category><![CDATA[Source Code]]></category>

		<guid isPermaLink="false">http://cuplis.net/?p=896</guid>
		<description><![CDATA[setelah sehari semalam duduk di depan monitor putih, akhirnya berhasil juga. apa yang berhasil? beberapa hari yang lalu seorang teman mengirimkan pdf yang berisi step2 pembuatan game sudoku versi android. hari jumat kemarin libur, waktu luang itu aku gunakan untuk upgrade brainware-nya si cuplis. hasilnya ada di sini.]]></description>
		<wfw:commentRss>http://cuplis.net/2011/04/23/sudoku-android-sukses/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>salah satu cara mencari peluang pada 2 mata uang logam</title>
		<link>http://cuplis.net/2011/01/10/salah-satu-cara-mencari-peluang-pada-2-mata-uang-logam/</link>
		<comments>http://cuplis.net/2011/01/10/salah-satu-cara-mencari-peluang-pada-2-mata-uang-logam/#comments</comments>
		<pubDate>Mon, 10 Jan 2011 11:23:42 +0000</pubDate>
		<dc:creator>cuplis</dc:creator>
				<category><![CDATA[Blog]]></category>
		<category><![CDATA[Kuliah]]></category>
		<category><![CDATA[Algoritma]]></category>

		<guid isPermaLink="false">http://cuplis.net/2011/01/10/salah-satu-cara-mencari-peluang-pada-2-mata-uang-logam/</guid>
		<description><![CDATA[misalnya ada 2 keping mata uang logam. tentukan kemungkinan munculnya 2 gambar 1 angka (g, g, a)! caranya simak gambar di bawah. kita buat beberapa baris awal di segitiga pascal. perhatikan baris ketiga, ambil koefisien yang berisikan a pangkat 1 dan b pangkat 2. koefisien yang bernilai 3 ini akan menjadi pembilang. kemudian jumlahkan semua [...]]]></description>
		<wfw:commentRss>http://cuplis.net/2011/01/10/salah-satu-cara-mencari-peluang-pada-2-mata-uang-logam/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>converter binary octal decimal hexa decimal</title>
		<link>http://cuplis.net/2010/11/04/converter-binoctdechex/</link>
		<comments>http://cuplis.net/2010/11/04/converter-binoctdechex/#comments</comments>
		<pubDate>Thu, 04 Nov 2010 05:40:30 +0000</pubDate>
		<dc:creator>cuplis</dc:creator>
				<category><![CDATA[Algoritma]]></category>
		<category><![CDATA[Blog]]></category>
		<category><![CDATA[Conversion]]></category>

		<guid isPermaLink="false">http://cuplis.net/?p=802</guid>
		<description><![CDATA[karena kemarin sempat berkecimpung dengan dunia konversi bilangan biner, desimal, oktal, dan hexa desimal, tiba2 hari ini ada keinginan untuk menyimpannya di cuplis.net. aplikasi ini opensource, pake javascript aja sih. bisa diakses di sini. entah ini namanya memanfaatkan code yang sudah ada atau bakat males kambuh lagi terserah penilainyalah. yang penting ada sedikit catatan untuk [...]]]></description>
		<wfw:commentRss>http://cuplis.net/2010/11/04/converter-binoctdechex/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
		<item>
		<title>algoritma deret fibonacci</title>
		<link>http://cuplis.net/2010/04/15/algoritma-deret-fibonacci/</link>
		<comments>http://cuplis.net/2010/04/15/algoritma-deret-fibonacci/#comments</comments>
		<pubDate>Thu, 15 Apr 2010 14:33:34 +0000</pubDate>
		<dc:creator>cuplis</dc:creator>
				<category><![CDATA[Algoritma]]></category>
		<category><![CDATA[Blog]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[Flowchart]]></category>
		<category><![CDATA[PHP]]></category>

		<guid isPermaLink="false">http://cuplis.net/?p=747</guid>
		<description><![CDATA[nih mumpung masih hangat, salah satu algoritma deret fibonacci : flowchart : contoh program : $limit = 10; $fibonacci = &#34;&#34;; for&#40;$i=1;$i&#60;=$limit;$i++&#41;&#123; if&#40;$i == 1&#41;&#123; $value&#91;$i&#93;=1; &#125;else&#123; $value&#91;$i&#93;=$value&#91;$i-2&#93; + $value&#91;$i-1&#93;; &#125; $fibonacci .= $value&#91;$i&#93;.&#34; &#34;; &#125; echo $fibonacci; output : 1 1 2 3 5 8 13 21 34 55]]></description>
		<wfw:commentRss>http://cuplis.net/2010/04/15/algoritma-deret-fibonacci/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>algoritma segi tiga pascal</title>
		<link>http://cuplis.net/2010/04/15/algoritma-segi-tiga-pascal/</link>
		<comments>http://cuplis.net/2010/04/15/algoritma-segi-tiga-pascal/#comments</comments>
		<pubDate>Thu, 15 Apr 2010 13:16:45 +0000</pubDate>
		<dc:creator>cuplis</dc:creator>
				<category><![CDATA[Algoritma]]></category>
		<category><![CDATA[Blog]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[Flowchart]]></category>
		<category><![CDATA[PHP]]></category>

		<guid isPermaLink="false">http://cuplis.net/?p=734</guid>
		<description><![CDATA[mumpung masih hangat, berikut ini salah satu contoh algoritma segitiga pascal beserta contoh codingnya di php flowchart : contoh program : $limit = 6; $pascal = &#34;&#34;; for&#40;$i=1;$i&#60;=$limit;$i++&#41;&#123; for&#40;$j=1;&#60;=$i;$j++&#41;&#123; if&#40;$j==1 &#124;&#124; $j==$i&#41;&#123; $value&#91;$i&#93;&#91;$j&#93; = 1; &#125;else&#123; $value&#91;$i&#93;&#91;$j&#93; = $value&#91;$i-1&#93;&#91;$j&#93; + $value&#91;$i-1&#93;&#91;$j-1&#93;; &#125; $pascal .= $value&#91;$i&#93;&#91;$j&#93;.&#34; &#34;; &#125; $pascal .= &#34; \n&#34;; &#125; echo $pascal; output [...]]]></description>
		<wfw:commentRss>http://cuplis.net/2010/04/15/algoritma-segi-tiga-pascal/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>linked list</title>
		<link>http://cuplis.net/2009/05/30/linked-list/</link>
		<comments>http://cuplis.net/2009/05/30/linked-list/#comments</comments>
		<pubDate>Sat, 30 May 2009 04:05:44 +0000</pubDate>
		<dc:creator>cuplis</dc:creator>
				<category><![CDATA[Blog]]></category>
		<category><![CDATA[Kuliah]]></category>
		<category><![CDATA[Algoritma]]></category>

		<guid isPermaLink="false">http://cuplis.net/?p=422</guid>
		<description><![CDATA[hitung jumlah simpul : Q = FIRST; Jum = 1; while &#40;Q != LAST&#41; &#123; Q = Q-&#62;LINK; Jum = Jum + 1; &#125; printf&#40;&#34;%i&#34;, JUM&#41;; atau Q = FIRST; Jum = 1; while &#40;Q-&#62;LINK != NULL&#41; &#123; Q = Q-&#62;LINK; Jum = Jum + 1; &#125; printf&#40;&#34;%i&#34;, JUM&#41;; atau Q = FIRST; Jum = [...]]]></description>
		<wfw:commentRss>http://cuplis.net/2009/05/30/linked-list/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>double ended queue</title>
		<link>http://cuplis.net/2009/05/30/double-ended-queue/</link>
		<comments>http://cuplis.net/2009/05/30/double-ended-queue/#comments</comments>
		<pubDate>Sat, 30 May 2009 03:23:04 +0000</pubDate>
		<dc:creator>cuplis</dc:creator>
				<category><![CDATA[Blog]]></category>
		<category><![CDATA[Kuliah]]></category>
		<category><![CDATA[Algoritma]]></category>

		<guid isPermaLink="false">http://cuplis.net/?p=410</guid>
		<description><![CDATA[ciri2 double ended queue : kosong : L = R + 1 penuh kanan : R = n &#8211; 1 penuh kiri : L = 0 penuh kanan dan kiri : R = n &#8211; 1 &#038;&#038; L = 0 bisa diisi dari kanan : R &#60; n bisa diisi dari kiri : L &#62; [...]]]></description>
		<wfw:commentRss>http://cuplis.net/2009/05/30/double-ended-queue/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>circular queue</title>
		<link>http://cuplis.net/2009/05/30/circular-queue/</link>
		<comments>http://cuplis.net/2009/05/30/circular-queue/#comments</comments>
		<pubDate>Sat, 30 May 2009 02:43:25 +0000</pubDate>
		<dc:creator>cuplis</dc:creator>
				<category><![CDATA[Blog]]></category>
		<category><![CDATA[Kuliah]]></category>
		<category><![CDATA[Algoritma]]></category>

		<guid isPermaLink="false">http://cuplis.net/?p=399</guid>
		<description><![CDATA[ciri2 circular queue : kosong : counter = 0 penuh : counter = n bisa diisi : counter &#60; n ada isinya : counter &#62; 0 kondisi awal : f = 0; r = -1; counter = 0; algoritma dasar circular queue : INSERT R = &#40;R+1&#41; % n; Q&#91;R&#93; = X; Counter++; DELETE X [...]]]></description>
		<wfw:commentRss>http://cuplis.net/2009/05/30/circular-queue/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>double stack</title>
		<link>http://cuplis.net/2009/05/30/double-stack/</link>
		<comments>http://cuplis.net/2009/05/30/double-stack/#comments</comments>
		<pubDate>Sat, 30 May 2009 02:00:31 +0000</pubDate>
		<dc:creator>cuplis</dc:creator>
				<category><![CDATA[Blog]]></category>
		<category><![CDATA[Kuliah]]></category>
		<category><![CDATA[Algoritma]]></category>

		<guid isPermaLink="false">http://cuplis.net/?p=379</guid>
		<description><![CDATA[ciri2 double stack : stack 1 kosong : top1 = -1 stack 2 kosong : top2 = n stack penuh (stack 1 dan stack 2 tidak bisa diisi) : top2 &#8211; top1 = 1 stack bisa diisi (stack 1 dan stack 2 tidak bisa diisi) : top2 &#8211; top1 &#62; 1 stack 1 ada isinya [...]]]></description>
		<wfw:commentRss>http://cuplis.net/2009/05/30/double-stack/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>single stack</title>
		<link>http://cuplis.net/2009/05/30/single-stack/</link>
		<comments>http://cuplis.net/2009/05/30/single-stack/#comments</comments>
		<pubDate>Sat, 30 May 2009 01:06:40 +0000</pubDate>
		<dc:creator>cuplis</dc:creator>
				<category><![CDATA[Blog]]></category>
		<category><![CDATA[Kuliah]]></category>
		<category><![CDATA[Algoritma]]></category>

		<guid isPermaLink="false">http://cuplis.net/?p=367</guid>
		<description><![CDATA[ciri2 single stack : kosong : top = -1 penuh : top = n-1 bisa diisi : top &#60; n-1 ada isinya : top &#62; -1 kondisi awal : top1 = -1; algoritma dasar single stack : PUSH top = top + 1; s&#91;top&#93; = x; POP x = s&#91;top&#93;; top = top - 1; [...]]]></description>
		<wfw:commentRss>http://cuplis.net/2009/05/30/single-stack/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

