<?xml version="1.0" encoding="UTF-8" ?>
<rss version="2.0" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:wikidot="http://www.wikidot.com/rss-namespace">

	<channel>
		<title>Bogo Sort also know as Stupid Sort.</title>
		<link>http://tibasicdev.wikidot.com/forum/t-13757076/bogo-sort-also-know-as-stupid-sort</link>
		<description>Posts in the discussion thread &quot;Bogo Sort also know as Stupid Sort.&quot; - This is a highly inefficient sort algorithm that I have not been able to implement on a my TI in BASIC.</description>
				<copyright></copyright>
		<lastBuildDate>Sat, 08 Aug 2026 12:57:07 +0000</lastBuildDate>
		
					<item>
				<guid>http://tibasicdev.wikidot.com/forum/t-13757076#post-4781513</guid>
				<title>Re: Bogo Sort also know as Stupid Sort.</title>
				<link>http://tibasicdev.wikidot.com/forum/t-13757076/bogo-sort-also-know-as-stupid-sort#post-4781513</link>
				<description></description>
				<pubDate>Thu, 24 Sep 2020 17:08:05 +0000</pubDate>
				<wikidot:authorName>byates</wikidot:authorName>				<wikidot:authorUserId>2077636</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>It is a crazy slow sort, part of the fun. The difficulty of writing the program is also part of the fun. What is scary is that even worse sorts have been invented.</p> <p>Thanks for the link.</p> 
				 	]]>
				</content:encoded>							</item>
					<item>
				<guid>http://tibasicdev.wikidot.com/forum/t-13757076#post-4781493</guid>
				<title>Re: Bogo Sort also know as Stupid Sort.</title>
				<link>http://tibasicdev.wikidot.com/forum/t-13757076/bogo-sort-also-know-as-stupid-sort#post-4781493</link>
				<description></description>
				<pubDate>Thu, 24 Sep 2020 16:18:20 +0000</pubDate>
								<wikidot:authorUserId>3338172</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>It might be a challenge to do this in TI-Basic because BOGO sorting sorts with multiple lines at a time. Doing this in TI-Basic will make the calculator extremely slow, to the point where nobody would watch it complete. The best way to do this is in Assembly.</p> <p>There is a 68k version of this program for the TI-89 if you wish to look at it:<br /> <a href="https://www.ticalc.org/archives/files/fileinfo/449/44921.html">https://www.ticalc.org/archives/files/fileinfo/449/44921.html</a></p> 
				 	]]>
				</content:encoded>							</item>
					<item>
				<guid>http://tibasicdev.wikidot.com/forum/t-13757076#post-4781076</guid>
				<title>Bogo Sort also know as Stupid Sort.</title>
				<link>http://tibasicdev.wikidot.com/forum/t-13757076/bogo-sort-also-know-as-stupid-sort#post-4781076</link>
				<description></description>
				<pubDate>Thu, 24 Sep 2020 01:52:08 +0000</pubDate>
				<wikidot:authorName>byates</wikidot:authorName>				<wikidot:authorUserId>2077636</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>Bogo Sort is one of the worst sorting algorithms around. But can be fun to watch run, if you are as easily amused as I am.</p> <p>For some reason I have not been able to make it work on the TI calculator I have, I blame my meds. Could some one implement it so that it shows the random version in action?</p> 
				 	]]>
				</content:encoded>							</item>
				</channel>
</rss>