Paper Info
Title
Dynamic Behavior of Simple Insertion Sort Algorithm
Abstract
This paper deals with new analytical and experimental aspects of influence of data structure and algorithm on sort dynamics. Traditional analysis of data structure-algorithm interface which based on computational complexity is incomplete because do not considers of dynamical effects in area between extremely best and worst cases of computing time. The main aim of this paper are investigations of the impact of long-term dependencies in data structure on sort efficiency. This approach treats interface data structure-algorithm as the complex system in opposition to the classical computational analysis which treats this interface as simple deterministic system. This new approach makes possibilities to determine power spectral density of sorting process and test the existence of 1/f noise in this process which in fact is not noise but reflects the intrinsic dynamic (data flow disturbances inside system) of selforganized computer system. The idea presented in this paper shows how complex system behavior provide a good perspective to analysis of whole computer system as well.
Year
Venue
Keywords
2006
Fundam. Inform.
selforganized computer system,dynamic behavior,interface data structure-algorithm,classical computational analysis,simple deterministic system,complex system,simple insertion sort algorithm,data flow disturbance,complex system behavior,data structure,data structure-algorithm interface,whole computer system,sorting algorithm,insertion sort,dynamics
Field
DocType
Volume
Data structure,Data analysis,Computer science,Insertion sort,In-place algorithm,Adaptive sort,sort,Algorithm,Theoretical computer science,Data flow diagram
Journal
72
Issue
ISSN
Citations 
1-3
0169-2968
4
PageRank 
References 
Authors
0.57
0
2
Name
Order
Citations
PageRank
Franciszek Grabowski1123.10
Dominik Strzałka2185.42