Complexity Analysis of a Simple Algorithm for Stable Minimum Storage MergingStable한 Minimum Storage 병합을 위한 단순알고리즘의 복잡도 분석
- Other Titles
- Stable한 Minimum Storage 병합을 위한 단순알고리즘의 복잡도 분석
- Authors
- 쿠츠너 아네; 김복선; 김정숙
- Issue Date
- Apr-2012
- Publisher
- 사단법인 한국지능시스템학회
- Keywords
- 스테이블 머징; minimum storage; 알고리즘 복잡도
- Citation
- 한국지능시스템학회 2012년도 춘계학술대회, v.22, no.1, pp.73 - 76
- Indexed
- OTHER
- Journal Title
- 한국지능시스템학회 2012년도 춘계학술대회
- Volume
- 22
- Number
- 1
- Start Page
- 73
- End Page
- 76
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/165834
- Abstract
- We contribute to the research on complexity analysis of a stable minimum storage merging algorithm that is particularly simply structured and transparently implemented by few lines of Pseudocode compared to its competitors. The algorithm presented in [4] is based on a structurally simple principle of symmetric splitting, where the start and end point of a rotation are computed by a repeated halving of two search spaces. The algorithm performs ?logn?+1 comparisons in the best case and O(mlog(n/m))comparisons in the worst case, where m and n are the sizes of the input sequences with m≤n. Hence, according to the lower bounds of merging the algorithm is asymptotically optimal regarding the number of comparisons. For proving the worst case complexity we consider several special cases. Based on the complexity of these special cases we prove the worst case complexity of the algorithm.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 정보시스템학과 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/165834)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.