Skip to content
Free planNo credit card requiredStart writing

article · Daffodil International University Journal of Science and Technology · 2010

Comparison Of Merge Sort with A New Trimerge Sorting Algorithm

Jannatun Nayeem, Md. Abu Salek

Cited by 0Open access

Abstract

The sorting problem is one of the most fundamental problems in computer science. This paper is concerned with a new Tri-merge sorting algorithm. This is a modification of Merge sort. It is competitive with the fastest shorting algorithms, especially when the number of elements to be sorted is too large. Compared with the preceding Merge sort, Tri-merge sort is more robust. It is not only faster on random inputs, but also avoids extreme comparisons. The empirical results show that Tri-merge sort is faster than Merge sort. This reduces the time complexity and makes the algorithm faster. For a large data, we try to implement this algorithm in well known programming language Java.

Cite this paper

APA 7

Nayeem, J., & Salek, M. A. (2010). Comparison Of Merge Sort with A New Trimerge Sorting Algorithm. Daffodil International University Journal of Science and Technology, 5(2), 44–47. https://doi.org/10.36481/diujst.v05i2.xyygwn83

MLA 9

Nayeem, Jannatun, and Md. Abu Salek. “Comparison Of Merge Sort with A New Trimerge Sorting Algorithm.” Daffodil International University Journal of Science and Technology, vol. 5, no. 2, 2010, pp. 44–47, https://doi.org/10.36481/diujst.v05i2.xyygwn83.

Chicago

Nayeem, Jannatun, and Md. Abu Salek. 2010. “Comparison Of Merge Sort with A New Trimerge Sorting Algorithm.” Daffodil International University Journal of Science and Technology 5 (2): 44–47. https://doi.org/10.36481/diujst.v05i2.xyygwn83.

Harvard

Nayeem, J. and Salek, M.A. (2010) ‘Comparison Of Merge Sort with A New Trimerge Sorting Algorithm’, Daffodil International University Journal of Science and Technology, 5(2), pp. 44–47. Available at: https://doi.org/10.36481/diujst.v05i2.xyygwn83.

BibTeX
@article{nayeem2010comparison,
  title = {{Comparison Of Merge Sort with A New Trimerge Sorting Algorithm}},
  author = {Nayeem, Jannatun and Salek, Md. Abu},
  journal = {Daffodil International University Journal of Science and Technology},
  volume = {5},
  number = {2},
  pages = {44--47},
  year = {2010},
  doi = {10.36481/diujst.v05i2.xyygwn83}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.