298 0

Complexity Analysis of a Simple Algorithm for Stable Minimum Storage Merging

Title
Complexity Analysis of a Simple Algorithm for Stable Minimum Storage Merging
Other Titles
Stable Minimum Storage 병합을 위한 단순알고리즘의 복잡도 분석
Author
KUTZNER, ARNE HOLGER
Keywords
스테이블 머징; 알고리즘 복잡도; minimum storage
Issue Date
2012-04
Publisher
사단법인 한국지능시스템학회
Citation
한국지능시스템학회 2012년도 춘계학술대회 학술발표논문집, v. 22, no. 1, Page. 73-76
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.
URI
http://hdl.handle.net/20.500.11754/38532https://dbpia.co.kr/journal/articleDetail?nodeId=NODE01858758
Appears in Collections:
COLLEGE OF ENGINEERING[S](공과대학) > INFORMATION SYSTEMS(정보시스템학과) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE