Improved Shellsort for the Worst-Case, the Best-Case and a Subset of the Average-Case Scenarios
Sorting involves rearrangement of items into ascending or descending order. There are several sorting algorithms but some are more efficient than others in terms of speed and memory utilization. Shellsort improves on Insertion sort by decreasing the number of comparisons made on the items to be sorted. This paper presents an Improved Shellsort algorithm that further decreases the number of...
Published at Journal of Computer Science & Its Application
Volume 14
Issue 2
Pages 73-84
Published in 2007
Oyelami, M.O., Azeta, A.A. and Ayo, C.K.
Azeta Ambrose A. » Professor Ambrose A. Azeta got his Bachelor of Science (B.Sc) degree in Computer Science from University of Benin, Nigeria from 1989 to 1992 with a second class (hons) upper division. Thereafter, he was admitted to University of Lagos, Nigeria to read Masters in Science (M.Sc) in Computer Science between 1998 and 1999. He has worked as a consultant in so many Information and Communications... view full profile
