<?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, 17 Jul 2026 05:07:36 GMT</lastBuildDate><atom:link href="https://ecency.com/created/insertionsort/rss.xml" rel="self" type="application/rss+xml"/><item><title><![CDATA[Golang Programming method of sort---insertion sort(插入排序)]]></title><description><![CDATA[插入排序(Insertion Sorting) 插入式排序属于内部算法，是对于欲排序的元素以插入的方式找寻该元素的适当位置，以达到排序的目的； 插入排序(Insertion Sorting)的基本思想： 把n个待排序的元素看成为一个有序表和一个无序表，开始时有序表中只包含一个元素，无序表中包含有n-1个元素；]]></description><link>https://ecency.com/@sslinux/golang-programming-method-of-sort-insertion-sort</link><guid isPermaLink="true">https://ecency.com/@sslinux/golang-programming-method-of-sort-insertion-sort</guid><category><![CDATA[golang]]></category><dc:creator><![CDATA[sslinux]]></dc:creator><pubDate>Mon, 31 Dec 2018 11:14:54 GMT</pubDate></item><item><title><![CDATA[Insertion Sort Program:]]></title><description><![CDATA[First we need to take out one marker element(index:1) and then we need to compare this with left side element. if left side element is higher than marker element then we need to shift the positions. same]]></description><link>https://ecency.com/@maheshreddy/insertion-sort-program</link><guid isPermaLink="true">https://ecency.com/@maheshreddy/insertion-sort-program</guid><category><![CDATA[java]]></category><dc:creator><![CDATA[maheshreddy]]></dc:creator><pubDate>Sat, 20 May 2017 11:05:12 GMT</pubDate></item></channel></rss>