https://blog.youkuaiyun.com/jzh2004zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/jzh2004/article/details/133695580https://blog.youkuaiyun.com/jzh2004/article/details/133695580jzh2004Mon, 09 Oct 2023 13:34:48 +0800https://blog.youkuaiyun.com/jzh2004/article/details/129992193https://blog.youkuaiyun.com/jzh2004/article/details/129992193jzh2004Thu, 06 Apr 2023 17:43:54 +0800https://blog.youkuaiyun.com/jzh2004/article/details/129988857https://blog.youkuaiyun.com/jzh2004/article/details/129988857jzh2004Thu, 06 Apr 2023 15:35:57 +0800https://blog.youkuaiyun.com/jzh2004/article/details/125100414https://blog.youkuaiyun.com/jzh2004/article/details/125100414jzh2004Fri, 09 Dec 2022 15:06:21 +0800https://blog.youkuaiyun.com/jzh2004/article/details/125102815https://blog.youkuaiyun.com/jzh2004/article/details/125102815jzh2004Thu, 02 Jun 2022 17:36:22 +0800https://blog.youkuaiyun.com/jzh2004/article/details/77715452https://blog.youkuaiyun.com/jzh2004/article/details/77715452jzh2004Wed, 30 Aug 2017 14:56:53 +0800https://blog.youkuaiyun.com/jzh2004/article/details/51790148https://blog.youkuaiyun.com/jzh2004/article/details/51790148jzh2004Thu, 30 Jun 2016 14:36:17 +0800https://blog.youkuaiyun.com/jzh2004/article/details/46440799https://blog.youkuaiyun.com/jzh2004/article/details/46440799jzh2004Wed, 10 Jun 2015 13:35:14 +0800https://blog.youkuaiyun.com/jzh2004/article/details/40426071https://blog.youkuaiyun.com/jzh2004/article/details/40426071jzh2004Fri, 24 Oct 2014 13:24:38 +0800https://blog.youkuaiyun.com/jzh2004/article/details/40049063https://blog.youkuaiyun.com/jzh2004/article/details/40049063jzh2004Mon, 13 Oct 2014 18:10:23 +0800https://blog.youkuaiyun.com/jzh2004/article/details/10904843https://blog.youkuaiyun.com/jzh2004/article/details/10904843jzh2004Mon, 02 Sep 2013 11:40:53 +0800https://blog.youkuaiyun.com/jzh2004/article/details/8721524https://blog.youkuaiyun.com/jzh2004/article/details/8721524jzh2004Tue, 26 Mar 2013 13:59:07 +0800https://blog.youkuaiyun.com/jzh2004/article/details/8717659https://blog.youkuaiyun.com/jzh2004/article/details/8717659jzh2004Mon, 25 Mar 2013 16:22:09 +0800https://blog.youkuaiyun.com/jzh2004/article/details/8207930https://blog.youkuaiyun.com/jzh2004/article/details/8207930jzh2004Wed, 21 Nov 2012 14:41:49 +0800https://blog.youkuaiyun.com/jzh2004/article/details/6082360https://blog.youkuaiyun.com/jzh2004/article/details/6082360jzh2004Fri, 17 Dec 2010 15:36:00 +0800PHPMailer 是一个专门用于php语言的邮件发送类，功能十分地强大，丰富了 PHP 本身单一的 mail() 函数。支持 SMTP 等甚至于附件。
 
PHPMailer 遵守 LGPL 授权，可以免费下载，当前版本是PHPMailer v2.2.1 更新于2007 年11月16日。
 
下载地址:http://phpmailer.codeworxtech.com/index.php?pg=sf&p=dl
 
注：下载时有后缀分别]]>https://blog.youkuaiyun.com/jzh2004/article/details/6077593https://blog.youkuaiyun.com/jzh2004/article/details/6077593jzh2004Wed, 15 Dec 2010 14:12:00 +0800https://blog.youkuaiyun.com/jzh2004/article/details/6000594https://blog.youkuaiyun.com/jzh2004/article/details/6000594jzh2004Wed, 10 Nov 2010 16:27:00 +0800https://blog.youkuaiyun.com/jzh2004/article/details/5990406https://blog.youkuaiyun.com/jzh2004/article/details/5990406jzh2004Fri, 05 Nov 2010 17:31:00 +0800前段时间去面试的时候一家公司出了这个题,太紧张了没写正确,今天重新写了下,验证过应该没问题,不过如果输入数字过大的话,就会出现错误,可能是不支持这么大的数字吧,最大只能999999999999
 
/** * 数字转中文 * 数字在999999999999以下 * 数字够大的时候小数点后会取整,奇怪了 * @param string $number 无序数组 * @return string $str 有序数组 */ function number2]]>https://blog.youkuaiyun.com/jzh2004/article/details/5984721https://blog.youkuaiyun.com/jzh2004/article/details/5984721jzh2004Wed, 03 Nov 2010 14:24:00 +0800最近写了个非递归的快速排序
 
/** * 快速排序算法 * * @param array $arr 无序数组 * @return array $arr 有序数组 */ function quick_sort($arr) { $sarr[0] = array('left'=>0,'right'=>count($arr) - 1);//该数组保存需要排序的子数组边界 $i = 0; $n = 1; while($i < $n) //判断还]]>https://blog.youkuaiyun.com/jzh2004/article/details/5984025https://blog.youkuaiyun.com/jzh2004/article/details/5984025jzh2004Wed, 03 Nov 2010 10:34:00 +0800最近整理了下以前学习的算法知识,虽然在WEB开发时算法用到的情况比较少,但还是把一些有用的算法做下备份。
 
折半查找法也称为二分查找法，它充分利用了元素间的次序关系，采用分治策略，可在最坏的情况下用O(log n)完成搜索任务。
【基本思想】
将n个元素分成个数大致相同的两半，取a[n/2]与欲查找的x作比较，如果x=a[n/2]则找到x，算法终止。如果xa[]]>