[feat] : Optimize Merge Sort Algorithm for Large Datasets

[Parvezkhan0]

Feature description

The current implementation of the Merge Sort algorithm performs efficiently for typical dataset sizes. However, it could benefit from optimizations to handle larger datasets more efficiently.

Tasks:

• Analyze the current Merge Sort implementation for potential performance bottlenecks.

• Research and implement optimizations (e.g., reducing unnecessary memory allocations, improving cache locality).

• Conduct benchmark tests on large datasets to validate the improvements.

[tianyizheng02]

Did you read the contributing guidelines?

Do not create an issue to contribute an algorithm. Please submit a pull request instead.