python

12.6 [HINT: key-value refers to sorting dictionaries.]

An algorithm that sorts key-value entries by key is said to be straggling if, any time two entries ei and e j have equal keys, but ei appears before e j in the input, then the algorithm places ei after e j in the output. Describe a change to the merge-sort algorithm in Section 12.2 to make it straggling.