Z*****Z
发帖数: 723 | 1 Each user ranks N songs in order of preference. Given a preference list, fin
d the user with the closest preferences. Measure "closest" according to the
number of inversions. Devise an N log N algorithm for the problem. | l******c
发帖数: 2555 | | s********l
发帖数: 998 | 3 谁和谁merge啊？
【在 l******c 的大作中提到】
: CLRS merge sort
| f*********5
发帖数: 576 | 4 举个例子吧，让别人能够更清楚的了解题意
谢谢！
fin
the
【在 Z*****Z 的大作中提到】
: Each user ranks N songs in order of preference. Given a preference list, fin
: d the user with the closest preferences. Measure "closest" according to the
: number of inversions. Devise an N log N algorithm for the problem.
|
|
