Explain how to get sorted subarrays

cambridgeltl / PairS

Aligning with Human Judgement: The Role of Pairwise Preference in Large Language Model Evaluators (Liu et al.; arXiv preprint arXiv:2403.16950)

MIT License

37 stars 1 forks source link

Explain how to get sorted subarrays #1

Open xuan1905 opened 3 months ago

xuan1905 commented 3 months ago

The paper's Algorithm 1 mentioned two sorted subarrays as the input, but the code only requires a list of summaries as an input.

Could you please explain where the (intermediate) subarrays appeared and how to sort them?

williamLyh commented 2 months ago

Think about the 'Merge sort' algorithm, where you divide the problem into sub-problems of 'merge two sorted sub-arrays'. This is a typical divide and conquer situation.