
InterviewQ
codefreestyle
这个作者很懒,什么都没留下…
展开
-
InterviewQuestionsMergesort
1.Merging with smaller auxiliary array. Suppose that the subarray a[0] to a[n−1] is sorted and the subarray a[n] to a[2∗n−1] is sorted. How can you merge the two subarrays so that a[0] to a[2∗n−1]翻译 2017-12-11 19:31:06 · 281 阅读 · 0 评论 -
InterviewQuestion-QuickSort
1。Nuts and bolts. A disorganized carpenter has a mixed pile of n nuts and n bolts. The goal is to find the corresponding pairs of nuts and bolts. Each nut fits exactly one bolt and each bolt fits exact原创 2017-12-15 15:31:25 · 328 阅读 · 0 评论 -
Coursear week4: Interview Questions: Priority Queues
Dynamic median.Design a data type that supports insert in logarithmic time, find-the-median in constant time, and remove-the-median in logarithmic time. If the number of keys in the data type is even...原创 2018-12-21 17:02:12 · 676 阅读 · 0 评论