<?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 22:25:54 GMT</lastBuildDate><atom:link href="https://ecency.com/created/quicksort/rss.xml" rel="self" type="application/rss+xml"/><item><title><![CDATA[Golang编程之——排序算法性能大比拼(选择排序、插入排序、快速排序),快排要上天]]></title><description><![CDATA[选择排序、插入排序以及快速排序性能比较： 测试数据，选择排序和插入排序的数据：容量为100000的随机数组，快速排序的为容量为1000万的随机数组； 选择排序： 代码： package main import ( "fmt" "math/rand" "time" ) //编写函数selectSort，完成排序； func SelectSort(arr]]></description><link>https://ecency.com/@sslinux/golang</link><guid isPermaLink="true">https://ecency.com/@sslinux/golang</guid><category><![CDATA[cn]]></category><dc:creator><![CDATA[sslinux]]></dc:creator><pubDate>Mon, 31 Dec 2018 13:58:48 GMT</pubDate></item><item><title><![CDATA[Golang Programming QuickSort(快速排序)]]></title><description><![CDATA[快速排序(Quick Sort) 快速排序(QuickSort)是对冒泡排序的一种改进； 基本思想是： 通过一趟排序将要排序的数据分割成独立的两部分，其中一部分的所有数据都比另外一部分的所有数据都要小， 然后再按次方法对这两部分数据分别进行快速排序，整个排序过程可以递归进行，以此达到整个数据编程有序序列。 快速排序法应用实例： 要求：]]></description><link>https://ecency.com/@sslinux/golang-programming-quicksort</link><guid isPermaLink="true">https://ecency.com/@sslinux/golang-programming-quicksort</guid><category><![CDATA[cn]]></category><dc:creator><![CDATA[sslinux]]></dc:creator><pubDate>Mon, 31 Dec 2018 12:06:39 GMT</pubDate></item><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>