📣 黑五价提前开抢|VIP一年通行证5折,蓝莓、Offer多多同步特惠
12
返回列表 发新帖
楼主: modifiedname
跳转到指定楼层
上一主题 下一主题
收起左侧

[Udacity CS215 Algorithm] 问个HW4计算中位数的题

🔗
defjex 2012-7-28 12:55:07 | 只看该作者
全局:
摘抄课本上的一段话: (如何求中位数)

You select a random pivot and partition the array as you would in the quicksort algorithm. Then, based on the index of the pivot element, you know which half of the array the desired element lies in. For example, say  n = 30, and after you select your pivot and partition the array, the first half has 10 elements (the half before the pivot). You know that the desired median should be the 4th smallest element in the larger half. To identify that, you partition the second half of the array and continue recursively.

The reason that this is not O(n log n) is that the recursive partition call is only on one half of the array, so the expected running time is n + (n/2) + (n/4) + (n/8) + ... = O(n).



回复

使用道具 举报

🔗
 楼主| modifiedname 2012-7-30 01:29:29 | 只看该作者
全局:
sigh i understand the difference between quicksort and median -- their expected run time differ, one is nlogn and the other is linear. but worse cases are the same.

actually found the solution in CLRS(算法导论)
worse case linear time 是个挺复杂的办法,要分成5份。。。section 9.3...
回复

使用道具 举报

您需要登录后才可以回帖 登录 | 注册账号
隐私提醒:
  • ☑ 禁止发布广告,拉群,贴个人联系方式:找人请去🔗同学同事飞友,拉群请去🔗拉群结伴,广告请去🔗跳蚤市场,和 🔗租房广告|找室友
  • ☑ 论坛内容在发帖 30 分钟内可以编辑,过后则不能删帖。为防止被骚扰甚至人肉,不要公开留微信等联系方式,如有需求请以论坛私信方式发送。
  • ☑ 干货版块可免费使用 🔗超级匿名:面经(美国面经、中国面经、数科面经、PM面经),抖包袱(美国、中国)和录取汇报、定位选校版
  • ☑ 查阅全站 🔗各种匿名方法

本版积分规则

>
快速回复 返回顶部 返回列表