H*m
2 楼
http://www.youtube.com/watch?v=kMMHOsYxqvk
太牛了,应该比我的tablet强太多了
尤其是对力度的dynamic range
太牛了,应该比我的tablet强太多了
尤其是对力度的dynamic range
s*m
3 楼
美国佐治亚州3岁女孩Alida患有一种罕见神经性疾病,必须靠氧气罐和呼吸管才能维持
生命。但幼小的她根本背不动这么沉重的氧气罐,于是Alida的父母从犹他州找来了治
疗犬Gibbs先生。从此不论Alida去哪,Gibbs先生都背着氧气瓶不离左右
生命。但幼小的她根本背不动这么沉重的氧气罐,于是Alida的父母从犹他州找来了治
疗犬Gibbs先生。从此不论Alida去哪,Gibbs先生都背着氧气瓶不离左右
w*f
4 楼
min-heap with only 5 element,
or top-k selection?
or top-k selection?
M*s
7 楼
还有根据孩子身上的气味变化提醒孩子准时服药的狗狗,都很有爱。
f*n
10 楼
Find k smallest numbers in a list of size n:
* Use max-heap of size k, iterate through list
O(n log k)
* Turn entire list into min-heap, then pop k times
O(n + k log n)
* Use worst-case linear-time selection algorithm to find the value of the k'
th smallest element, then partition the list with this value, and take the
first k elements
O(n)
* Use max-heap of size k, iterate through list
O(n log k)
* Turn entire list into min-heap, then pop k times
O(n + k log n)
* Use worst-case linear-time selection algorithm to find the value of the k'
th smallest element, then partition the list with this value, and take the
first k elements
O(n)
h*e
12 楼
It is only asking for the five smallest numbers. Forget about min-heap and
linear time selection algorithm. The constant factor is so small that by
just keeping five ints and do comparisons directly you would probably yield
a faster program than all the algorithms you listed here.
k'
【在 f*******n 的大作中提到】![](/moin_static193/solenoid/img/up.png)
: Find k smallest numbers in a list of size n:
: * Use max-heap of size k, iterate through list
: O(n log k)
: * Turn entire list into min-heap, then pop k times
: O(n + k log n)
: * Use worst-case linear-time selection algorithm to find the value of the k'
: th smallest element, then partition the list with this value, and take the
: first k elements
: O(n)
linear time selection algorithm. The constant factor is so small that by
just keeping five ints and do comparisons directly you would probably yield
a faster program than all the algorithms you listed here.
k'
【在 f*******n 的大作中提到】
![](/moin_static193/solenoid/img/up.png)
: Find k smallest numbers in a list of size n:
: * Use max-heap of size k, iterate through list
: O(n log k)
: * Turn entire list into min-heap, then pop k times
: O(n + k log n)
: * Use worst-case linear-time selection algorithm to find the value of the k'
: th smallest element, then partition the list with this value, and take the
: first k elements
: O(n)
相关阅读
相信「世界末日论」 父母杀3孩后自杀女子公交没让座遭老汉多次暴打 被骂闭眼在装Re: 姓张的为啥比较惨? (转载)小时候第一次吸烟学术版,问个科普问题开始排小破明天的包子"I feel pretty stupid that I don't know any foreign languages," Gates saidRe: 国内带了个TL WVR300路由器,不能正常收发邮件 (转载)鱼是怎么不被自己扎到的转载:2014年没品新闻:女子从F罩杯缩到D杯夫妻为生二胎向女儿写保证书:永远第一喜欢你 (转载)奶茶会不会被强东当作性贿赂的工具?美国留学生短片《头七》,献给全天下所有的渣男 (转载)发起一个绝对健康向上的活动释传真送给季建业一个拔鞋用的“提拔”包子机不让发超过100个ID,剩下的明天发Re: 大家都说说买到假货,造成重大损失的经历吧。 (转载)高考阅卷老师的给分真的很草率吗?小坡单挑走地鸡农民称存钱不如存人20年生11胎(图)