n****n 发帖数: 59 | 1 偶尔看到一个题
http://stackoverflow.com/questions/109023/best-algorithm-to-cou
想起以前面试一模一样的题,当时还觉得太简单,其实是用了最蠢的做法,根本没了解
出题人的意图。人要多牛x才能练出这功夫啊,神码prime
,thinking,effective, pearls 全是浮云。 |
t****t 发帖数: 6806 | 2 这个在版上讨论好多次了.
【在 n****n 的大作中提到】 : 偶尔看到一个题 : http://stackoverflow.com/questions/109023/best-algorithm-to-cou : 想起以前面试一模一样的题,当时还觉得太简单,其实是用了最蠢的做法,根本没了解 : 出题人的意图。人要多牛x才能练出这功夫啊,神码prime : ,thinking,effective, pearls 全是浮云。
|
X****r 发帖数: 3557 | 3 这个其实是很好的题,可惜网上流传太广,没法用了。
【在 t****t 的大作中提到】 : 这个在版上讨论好多次了.
|
c*****m 发帖数: 1160 | 4 depends on how you define "best".
From the maintenance point of view, the algorithm in the answer is the worst
. If the question changed to 33-bit, then everything is changed. and I doubt
that this algorithm (no matter how you change those magic numbers) is
working for 33-bit. |
L***n 发帖数: 6727 | 5 It's definitely best at boggling my mind, probably making my eyes bleed too
compared with other solutions
worst
doubt
【在 c*****m 的大作中提到】 : depends on how you define "best". : From the maintenance point of view, the algorithm in the answer is the worst : . If the question changed to 33-bit, then everything is changed. and I doubt : that this algorithm (no matter how you change those magic numbers) is : working for 33-bit.
|
n****n 发帖数: 59 | 6 是吗?那这算哪门功夫?没读过knuth的经典,是不是哪里有传授此种功夫?
【在 t****t 的大作中提到】 : 这个在版上讨论好多次了.
|
G*****7 发帖数: 1759 | 7 Bit hacks are gonna hack.
Either u were tortured by similar homework problems in cs 102, or u weren't
. That's all.
【在 n****n 的大作中提到】 : 偶尔看到一个题 : http://stackoverflow.com/questions/109023/best-algorithm-to-cou : 想起以前面试一模一样的题,当时还觉得太简单,其实是用了最蠢的做法,根本没了解 : 出题人的意图。人要多牛x才能练出这功夫啊,神码prime : ,thinking,effective, pearls 全是浮云。
|
k**********g 发帖数: 989 | 8
Introduction to computer architecture (also known as CPU/VLSI design)
【在 n****n 的大作中提到】 : 是吗?那这算哪门功夫?没读过knuth的经典,是不是哪里有传授此种功夫?
|
y******e 发帖数: 203 | |