图 书 馆
线性时间排序：下限，计数排序，基数排序Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort |
|
| 课程网址: | http://videolectures.net/mit6046jf05_demaine_lec05/ |
| 主讲教师: | Erik Demaine |
| 开课单位: | 麻省理工学院 |
| 开课时间: | 2009-02-10 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | //"Today we're going to talk about sorting, which may not come as such a big surprise. We talked about sorting for a while, but we're going to talk about it at a somewhat higher level and question some of the assumptions that we've been making so far. And we're going to ask the question how fast can we sort? A pretty natural question. You may think you know the answer. Perhaps you do. Any suggestions on what the answer to this question might be? There are several possible answers. Many of them are partially correct. Let's hear any kinds of answers you'd like and start waking up this fresh morning. Sorry?...// |
| 关 键 词: | 排序; 假设; 线性时间 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2020-06-26：yumf |
| 阅读次数: | 52 |