<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[swbb2009的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/swbb2009</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; swbb2009]]></copyright><item><title><![CDATA[集合打乱顺序Collections.shuffle()方法源码小记]]></title><link>https://blog.youkuaiyun.com/swbb2009/article/details/84100859</link><guid>https://blog.youkuaiyun.com/swbb2009/article/details/84100859</guid><author>swbb2009</author><pubDate>Thu, 15 Nov 2018 11:51:44 +0800</pubDate><description><![CDATA[写博客只是为了记录一些知识，刚刚入行，如果写的不对请各位多多指正。

刚开始看算法一书，温习了比较初级的二分法，如下图


private static int BinarySearch(int[] arr,int key) {
		int begin =0;
		int end =arr.length-1;
		while(begin&amp;lt;=end) {
			int mid = begin+...]]></description><category></category></item></channel></rss>