Kova sıralamasına yeni bir yaklaşım

The studies on sorting algorithms can be grouped into four categories: choosing a mathematical model and applying it to the sorting process, parallel processing, algorithm analysis and hybrid algorithm studies.A hybrid mechanism can be applied to bucket sort thanks to its modularity. This modularity can be used for different implementation mechanisms.One of the best algorithms which work with great performance on medium size lists is the shell sort. The shell sort average time complexity can change with a different increment size decision strategy.With the combination of the shell sort and bucket sort, and applying some tricks during the implementation steps of the bucket sort, one can obtain faster time results regarding to the classical bucket sort and the Shell sort. These improvements can lead the researchers to new concepts in implementation techniques and also to new hybrid algorithms in the area of sorting.