Sıralıya yakın diziler için yeni bir birleştirme tabanlı sıralama algoritması

Methods and algorithms, i.e. sorting algorithms, can be customized to increase system performance in large data systems. In order to do this, various parameters like data flow or data characteristics must be known.Widely used sorting algorithms (e.g., HeapSort, MergeSort) do not consider the characteristics of data and introduce general solutions for almost all cases. Better performance algorithms can be found when some parameters (e.g., Sortedness) taken into account.In this work, first the sorting algorithms which can provide a basis for the new method are reviewed. Also, because the new method is merge based, former merge algorithms are reviewed. Finally, based on the former methods, new sorting method is presented for nearly sorted lists.