an old sorting algorithm - 未名空间MITBBS历史存档

国际科技财经博客移民网络热点娱乐民生时事公众号

Redian新闻

>未名空间

>JobHunting - 待字闺中

an old sorting algorithm

an old sorting algorithm# JobHunting - 待字闺中

N*g2012-01-21 08:01

1 楼

☆─────────────────────────────────────☆
winderwater (长期大量厚道收购苹果手机) 于 (Sun Jul 19 14:06:22 2009, 美东) 提到:
http://www.officedepot.com/a/products/502074/Toshiba-Satellite-L505-S5966-15-6/
☆─────────────────────────────────────☆
Sickdeal (Slickdeal) 于 (Sun Jul 19 14:31:12 2009, 美东) 提到:
这个性价比不如前天ＮＥＷＥＧＧ的３１２刀的　Lenovo吧？

j*r2012-01-21 08:01

2 楼

two unordered array, one long,n , one short, m, sort them into a large array
. Someone say that we can sort the short array, it's mlogm, and binary
search and insert the long, the total is nlogm. but i am not clear about the
insert part, how it can be nlogm.
If there is a better algorithm, please share.
Thank for helps.

q*x2012-01-21 08:01

3 楼

can't be better than O((n+m)log(n+m))
otherwise, you can always split one single unsorted array into long/short
pair.

array
the

【在 j********r 的大作中提到】

: two unordered array, one long,n , one short, m, sort them into a large array
: . Someone say that we can sort the short array, it's mlogm, and binary
: search and insert the long, the total is nlogm. but i am not clear about the
: insert part, how it can be nlogm.
: If there is a better algorithm, please share.
: Thank for helps.