Measuring Algorithms Performance in Dynamic Linked List and Arrays

The focus of the research is on investigating the organization and structure of a list of data in order to find more efficient algorithmic solution. The aim of the realised experiment was to analyze, compare and measure the efficiency of algorithms for searching, insertion and deletion in a list of...

Full description

Saved in:
Bibliographic Details
Published inTEM Journal Vol. 1; no. 2; pp. 98 - 103
Main Authors Fetaji, Bekim, Fetaji, Majlinda, Ebibi, Mirlinda
Format Journal Article
LanguageEnglish
Published UIKTEN - Association for Information Communication Technology Education and Science 01.01.2012
Subjects
Electronic information storage and retrieval
Information Architecture
array
Dynamic Linked List (DLL)
data structure
algorithm
Online AccessGet full text
ISSN2217-8309
2217-8333
DOI10.18421/TEM12-06

Cover

More Information
Summary:The focus of the research is on investigating the organization and structure of a list of data in order to find more efficient algorithmic solution. The aim of the realised experiment was to analyze, compare and measure the efficiency of algorithms for searching, insertion and deletion in a list of elements. An experimental case study is done through implementing the list as: 1) Array Data Structure and as 2) Dynamic Linked List Data Structure and measuring the performance. The contribution of the study is based on the realized experimental case study analyses, its insights and recommendations for improving the efficiency of algorithms for searching, insertion and deletion in a list of elements. The recommendations, and insights gained from the realized measurements are presented and discussed.
ISSN:2217-8309
2217-8333
DOI:10.18421/TEM12-06