https://blog.youkuaiyun.com/xsfl1234zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/xsfl1234/article/details/72972052https://blog.youkuaiyun.com/xsfl1234/article/details/72972052xsfl1234Fri, 09 Jun 2017 21:14:35 +0800https://blog.youkuaiyun.com/xsfl1234/article/details/71941456https://blog.youkuaiyun.com/xsfl1234/article/details/71941456xsfl1234Sun, 14 May 2017 11:45:10 +0800https://blog.youkuaiyun.com/xsfl1234/article/details/71843595https://blog.youkuaiyun.com/xsfl1234/article/details/71843595xsfl1234Sat, 13 May 2017 16:57:07 +0800 输入：k，data[n]; (1) 选择 k 个初始中心点，例如 c[0] = data[0]， ……，c[k-1]=data[k-1]; (2) 对于 data[0]，……，data[n]，分别与 c[0]，……，c[k-1]比较，假设 c[i]差值最少，就标记为 i； (3) 对于所有标记为 i 点，重新计算 c[]]>https://blog.youkuaiyun.com/xsfl1234/article/details/69364912https://blog.youkuaiyun.com/xsfl1234/article/details/69364912xsfl1234Wed, 05 Apr 2017 22:25:18 +0800 W = N S(W-1) = W-F+2P P = ((S-1)W-S+F)/2]]>https://blog.youkuaiyun.com/xsfl1234/article/details/68962713https://blog.youkuaiyun.com/xsfl1234/article/details/68962713xsfl1234Mon, 03 Apr 2017 18:01:55 +0800https://blog.youkuaiyun.com/xsfl1234/article/details/67674087https://blog.youkuaiyun.com/xsfl1234/article/details/67674087xsfl1234Tue, 28 Mar 2017 22:43:30 +0800https://blog.youkuaiyun.com/xsfl1234/article/details/67669707https://blog.youkuaiyun.com/xsfl1234/article/details/67669707xsfl1234Tue, 28 Mar 2017 22:40:28 +0800https://blog.youkuaiyun.com/xsfl1234/article/details/64926265https://blog.youkuaiyun.com/xsfl1234/article/details/64926265xsfl1234Wed, 22 Mar 2017 19:52:33 +0800https://blog.youkuaiyun.com/xsfl1234/article/details/64443292https://blog.youkuaiyun.com/xsfl1234/article/details/64443292xsfl1234Tue, 21 Mar 2017 16:04:35 +0800https://blog.youkuaiyun.com/xsfl1234/article/details/60956401https://blog.youkuaiyun.com/xsfl1234/article/details/60956401xsfl1234Thu, 09 Mar 2017 11:01:39 +0800https://blog.youkuaiyun.com/xsfl1234/article/details/56509113https://blog.youkuaiyun.com/xsfl1234/article/details/56509113xsfl1234Wed, 22 Feb 2017 22:10:40 +0800https://blog.youkuaiyun.com/xsfl1234/article/details/54925814https://blog.youkuaiyun.com/xsfl1234/article/details/54925814xsfl1234Wed, 08 Feb 2017 13:32:31 +0800https://blog.youkuaiyun.com/xsfl1234/article/details/54862609https://blog.youkuaiyun.com/xsfl1234/article/details/54862609xsfl1234Sat, 04 Feb 2017 13:45:26 +0800https://blog.youkuaiyun.com/xsfl1234/article/details/54632970https://blog.youkuaiyun.com/xsfl1234/article/details/54632970xsfl1234Fri, 20 Jan 2017 17:58:52 +0800https://blog.youkuaiyun.com/xsfl1234/article/details/54429469https://blog.youkuaiyun.com/xsfl1234/article/details/54429469xsfl1234Sat, 14 Jan 2017 21:51:33 +0800https://blog.youkuaiyun.com/xsfl1234/article/details/53957649https://blog.youkuaiyun.com/xsfl1234/article/details/53957649xsfl1234Sat, 31 Dec 2016 18:53:06 +0800https://blog.youkuaiyun.com/xsfl1234/article/details/53955471https://blog.youkuaiyun.com/xsfl1234/article/details/53955471xsfl1234Sat, 31 Dec 2016 14:02:36 +0800https://blog.youkuaiyun.com/xsfl1234/article/details/53955422https://blog.youkuaiyun.com/xsfl1234/article/details/53955422xsfl1234Sat, 31 Dec 2016 13:56:15 +0800https://blog.youkuaiyun.com/xsfl1234/article/details/53729739https://blog.youkuaiyun.com/xsfl1234/article/details/53729739xsfl1234Sun, 18 Dec 2016 20:55:26 +0800https://blog.youkuaiyun.com/xsfl1234/article/details/53646321https://blog.youkuaiyun.com/xsfl1234/article/details/53646321xsfl1234Wed, 14 Dec 2016 21:01:33 +0800 汇编 -> 机器语言 二进制的 .o 文件可以通过objdump反汇编成汇编代码，然后就可以通过汇编代码仔细地考察c代码的效率啦 从效果上来说感觉对应地还不错 书上的例子：int accum = 0; int sum(int x,int y) { int t = x + y; accum += t; retu]]>