Call for Paper - January 2023 Edition
IJCA solicits original research papers for the January 2023 Edition. Last date of manuscript submission is December 20, 2022. Read More

MQ Sort an Innovative Algorithm using Quick Sort and Merge Sort

International Journal of Computer Applications
© 2015 by IJCA Journal
Volume 122 - Number 21
Year of Publication: 2015

Renu and Manisha. Article: MQ Sort an Innovative Algorithm using Quick Sort and Merge Sort. International Journal of Computer Applications 122(21):10-14, July 2015. Full text available. BibTeX

	author = {Renu and Manisha},
	title = {Article: MQ Sort an Innovative Algorithm using Quick Sort and Merge Sort},
	journal = {International Journal of Computer Applications},
	year = {2015},
	volume = {122},
	number = {21},
	pages = {10-14},
	month = {July},
	note = {Full text available}


Sorting is a commonly used operation in computer science. In addition to its main job of arranging lists or arrays in sequence, sorting is often also required to facilitate some other operation such as searching, merging and normalization or used as an intermediate operation in other operations. A sorting algorithm consists of comparison, swap, and assignment operations[1-3]. There are several simple and complex sorting algorithms that are being used in practical life as well as in computation such as Quick sort, Bubble sort, Merge sort, Bucket sort, Heap sort, Radix sort etc. But the application of these algorithms depends on the problem statement. This paper introduces MQ sort which combines the advantages of quick sort and Merge sort. The comparative analysis of performance and complexity of MQ sort is done against Quick sort and Merge sort. MQ sort significantly reduces complexity and provides better performance than Quick sort, Merge sort.


  • Donald E. Knuth et al. "The Art of Computer Programming," Sorting and Searching Edition 2, Vol. 3.
  • Cormen et al. "Introduction to Algorithms," Edition 3, 31 Jul, 2009.
  • D. Knuth, "The Art of Computer programming Sorting and Searching", 2nd edition, Addison-Wesley, vol. 3, (1998).
  • A. D. Mishra and D. Garg, "Selection of the best sorting algorithm", International Journal of Intelligent Information Processing, vol. 2, no. 2, (2008) July-December, pp. 363-368.
  • C. A. R. Hoare, Algorithm 64: Quick sort. Comm. ACM, vol. 4, no. 7 (1961), pp. 321.
  • Ahmed M. Aliyu, Dr. P. B. Zirra, "A Comparative Analysis of Sorting Algorithms on Integer and Character Arrays," The International Journal Of Engineering And Science (IJES). , ISSN(e): 2319 – 1813 ISSN(p): 2319 – 1805.
  • E. Horowitz, S. Sahni and S. Rajasekaran, Computer Algorithms, Galgotia Publications.
  • Horowitz, E. , Sahni. S, Fundamentals of Computer Algorithms, Computer Science Press, Rockville. Md
  • Laila Khreisat, "Quick Sort: A Historical Perspective and Empirical Study", IJCSNS
  • T. H. Coreman, C. E. Leierson, R. L. Rivest and C. Stein, Introduction to Algorithms, 2nd edition, MIT Press.
  • John Darlington, Remarks on "A Synthesis of Several Sorting Algorithms", Springer Berlin / Heidelberg, pp 225-227,Volume 13, Number 3 / March, 1980.
  • http://www. geeksforgeeks. org/iterative-quick-sort/
  • https://en. wikipedia. org/?title=Merge_sort
  • https://en. wikipedia. org/?title=Quicksort
  • http://www. geeksforgeeks. org/forums/topic/merge-sort/