<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[RSS Feed]]></title><description><![CDATA[RSS Feed]]></description><link>https://ecency.com</link><image><url>https://ecency.com/logo512.png</url><title>RSS Feed</title><link>https://ecency.com</link></image><generator>RSS for Node</generator><lastBuildDate>Fri, 04 Sep 2026 23:38:56 GMT</lastBuildDate><atom:link href="https://ecency.com/created/bogosort/rss.xml" rel="self" type="application/rss+xml"/><item><title><![CDATA[Could Bogosort be the most efficient sorting algorithm?]]></title><description><![CDATA[Recently I was thinking about it, and our most efficient "everyday use" sorting algorithms are in the neighborhood of O(n log n). Now what if it were possible to create a "smart" Bogosort]]></description><link>https://ecency.com/@qtip2001/could-bogosort-be-the-most-efficient-sorting-algorithm</link><guid isPermaLink="true">https://ecency.com/@qtip2001/could-bogosort-be-the-most-efficient-sorting-algorithm</guid><category><![CDATA[computer]]></category><dc:creator><![CDATA[qtip2001]]></dc:creator><pubDate>Sun, 25 Jun 2017 00:47:24 GMT</pubDate><enclosure url="https://i.ecency.com/p/PB8ro82ZpZP5xqHVTtgzxr9jRnPYTxeDK7ZMexdP1SHebeFv2VtVxGJT3QUB573kjRdgw5TMJeopFtxqoQ7ofZJMBBQv46pbfKczy4tY9wFjTe2A?format=match&amp;mode=fit" length="0" type="false"/></item></channel></rss>