2019年7月4日
Time Complexity of Randomized Quick Sort
摘要： Consider the randomized quick sort (i.e. the pivot is randomly chosen). Let the sorted array $A = [b_1, \dots, b_n]$. Put $A_{ij} = \{b_i \text{ is co 阅读全文
posted @ 2019-07-04 09:45 resolvent 阅读(142) 评论(0) 推荐(0) 编辑