COMPARISON OF MERGE SORT WITH A NEW TRI- MERGE SORTING ALGORITHM

@inproceedings{Nayeem2010COMPARISONOM,
  title={COMPARISON OF MERGE SORT WITH A NEW TRI- MERGE SORTING ALGORITHM},
  author={Jannatun Nayeem and Md. Abu Salek},
  year={2010}
}
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… CONTINUE READING

Figures, Tables, and Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 10 REFERENCES

An efficient sorting algorithm with no additional space, Compute

W. R. Dufrene, F. C. Lin
  • J. 35
  • 1992
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

She stood 1 class 1 in M.S final examination

K. H. Rosen
  • “Discrete Mathematics and its applications”,
  • 2003
VIEW 1 EXCERPT

An efficient sorting algorithm with no additional space

Y.-T. Tsai, C. Y. Tang, M. A. Weiss
  • Compute . J .
  • 1993

Quick sort

R. Sedgewick
  • Garland Publishing,
  • 1980
VIEW 1 EXCERPT

Heap sort (alg. 232)

J. W. Williams
  • Comm. ACM,
  • 1964
VIEW 1 EXCERPT