<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[sinbadxyf的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/sinbadxyf</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; sinbadxyf]]></copyright><item><title><![CDATA[算法学习记录-希尔排序]]></title><link>https://blog.youkuaiyun.com/sinbadxyf/article/details/49943969</link><guid>https://blog.youkuaiyun.com/sinbadxyf/article/details/49943969</guid><author>sinbadxyf</author><pubDate>Fri, 20 Nov 2015 10:34:40 +0800</pubDate><description><![CDATA[针对快速排序的优化，原理在快速排序前针对使数组内任意间隔为H的字数组是有序的，当H变化为1时直接为快速排序，大概的代码描述如下：

public class ShellSort {

    public static void sort(int[] a)
    {
        int N = a.length;
        int H = 1;
        whil]]></description><category></category></item></channel></rss>