摘要：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.
关键词：Dynamic Linked List (DLL);array;algorithm;data structure.
