MinFinder: A New Approach in Sorting Algorithm

Md Shohel Rana, Md Altab Hossin, S. M.Hasan Mahmud, Hosney Jahan, A. K.M.Zaidi Satter, Touhid Bhuiyan

Research output: Contribution to conferenceConference paper

6 Citations (Scopus)


Sorting a set of unsorted items is a task that happens in computer programming while a computer program has to follow a sequence of precise directions to accomplish that task. In order to find things quickly by making extreme values easy to see, sorting algorithm refers to specifying a technique to arrange the data in a particular order or format where maximum of communal orders is in arithmetic or lexicographical order. A lot of sorting algorithms has already been developed and these algorithms have enhanced the performance in the factors including time and space complexity, stability, correctness, definiteness, finiteness, effectiveness, etc. A new approach has been proposed in this paper in sorting algorithm called MinFinder to overcome some of the downsides and performs better compared to some conventional algorithms in terms of stability, computational time, complexity analysis.
Original languageEnglish
Number of pages7
Publication statusPublished - 1 Jan 2018
Externally publishedYes
EventProcedia Computer Science -
Duration: 1 Jan 2018 → …


ConferenceProcedia Computer Science
Period1/01/18 → …


  • Correctness
  • Definiteness
  • Effectiveness
  • Finiteness
  • Inplace
  • Loop Invariant
  • MinFinder
  • Sorting
  • Space Complexity
  • Stability
  • Time


Dive into the research topics of 'MinFinder: A New Approach in Sorting Algorithm'. Together they form a unique fingerprint.

Cite this