Browse > Article
http://dx.doi.org/10.5391/JKIIS.2010.20.3.428

An Efficient In-Place Block Rotation Algorithm and its Complexity Analysis  

Kim, Pok-Son (국민대학교 수학과)
Kutzner, Arne (한양대학교 정보시스템학과)
Publication Information
Journal of the Korean Institute of Intelligent Systems / v.20, no.3, 2010 , pp. 428-433 More about this Journal
Abstract
The notion "block rotation" denotes the operation of exchanging two consecutive sequences of elements uv to vu. There are three already well-known block rotation algorithms called BlockRotation, Juggling and Reversal algorithm. Recently we presented a novel block rotation algorithm called QuickRotation. In this paper we compare QuickRotation to these three known block rotation algorithms. This comparison covers a complexity analysis as well as benchmarking and shows that a switch to QuickRotation is almost always advantageous.
Keywords
Algorithm analysis; Algorithm complexity; Elementary algorithm; Block rotation;
Citations & Related Records
연도 인용수 순위
  • Reference
1 P. S. Kim and A. Kutzner, “An Improved Algorithmic Solution for the Problem of Block -Rotation.” In 10th International Symposium on Advanced Intelligent Systems, pp. 161-164, Busan, Korea, August 17-19, 2009.
2 van Leeuwen, J. “The Complexity of Data Organisation.” Mathematical Centre Tracts 81 (Mathematical Centre, Amsterdam), 1976.
3 L. T. Pardo. "Stable sorting and merging with optimal space and time bounds," SIAM Journal on Computing, 6(2), pp. 351-372, 1977.   DOI
4 T. Cormen, C. Leiserson, R. Rivest and C. Stein, Introduction to Algorithms, MIT Press, 2001.
5 J. Bentley. Programming Pearls. Addison-Wesley, Inc, 2nd edition, 2000.
6 K. Dudzinski and A. Dydek. “On a stable storage merging algorithm.” Information Processing Letters, 12(1):58, February 1981.