Performance Analysis of MQSort Algorithm: Mixture of Merge and Quick Sort

Sorting is a fundamental operation widely used in computer science for organizing data in a particular order. This involves operations such as comparison, exchange, and assignment. Multiple algorithms like Merge Sort, Quick Sort, Radix Sort, etc., have evolved with various performance traits. This paper proposes and evaluates a hybrid algorithm MQSort, which combines the strengths of Merge and Quick Sort. The proposed algorithm reduces complexity and improves runtime efficiency. Comparative analysis shows MQSort performs better than its individual counterparts, especially for larger datasets46†source.