Analysis of a shellsort algorithm
Abstract
References
Index Terms
- Analysis of a shellsort algorithm
Recommendations
Analyzing variants of Shellsort
We consider two variants of Shellsort --- Dobosiewicz sort and Shaker sort. Not much is known about the running time of these algorithms. We prove that the worst-case time of Shaker sort is O( n 3/2log 3 n ) for certain sequences of increments and ...
Increasing the efficiency of quicksort using a neural network based algorithm selection model
Quicksort is one of the most popular sorting algorithms, it is based on a divide-and-conquer technique and has a wide acceptance as the fastest general-purpose sorting technique. Though it is successful in separating large partitions into small ones, ...
A new external sorting algorithm with no additional disk space
This paper is concerned with an external sorting algorithm with no additional disk space. The proposed algorithm is a hybrid one that uses Quicksort and special merging process in two distinct phases. The algorithm excels in sorting a huge file, which ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
BIT Computer Science and Numerical Mathematics
United States
Publication History
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in