Java's built$-$in default sort implementation checks the type of the items being sorted and decides which sorting

algorithm to use accordingly. If passed an array of $1000$ integers, Java would use a variation of Quick Sort, but if

passed an array of $1000$ Point objects, Java would use Merge Sort.

Explain why it might be beneficial to use these two different sorting algorithms by identifying a property $($or prop$-$

erties$)$ that differ between the algorithms and why each would be most appropriate for the case described.

sentences$)$