Dear moderators,

I have a suggestion to edit

https://leetcode.com/explore/learn/card/recursion-ii/470/divide-and-conquer/2868/

In the implementation of merge sort the condition is if left_list[left_cursor] < right_list[right_cursor]:

It makes this implementation unstable. I think it's better to change the condtion to“L <= R”so t we favor left values over right values, if they are equal. This makes the algorithm stable.

Also we can metion that's it's a stable algorithm in text