The teaching of static arrays, dynamics and linked lists. What to use? Code analysis

Abstract

The present work, directed to professors of Programming, programmers, students of Computer Engineering and of Sciences of the Computation, has the objective to argue the potentialities that offer the linked lists when comparing them with the arrays of static size and the dynamic arrays, structures that historically have
coexisted in the most used programming languages. Algorithms were also obtained for the solution of problems, the graphic modeling of the structures, codes for the creation, printing, and search of elements, with the use of Java and C # programming languages and a set of recommendations of character
methodological, valid for students, programming teachers and programmers. To this end, scientific research methods were applied, among them: documentary analysis, modeling, system approach, observation, storms of ideas together with
the experiences of authors as programming teachers. Among the conclusions is expressed that, in the teaching and learning process of the arrays, contiguous lists and linked lists it is advisable to write the algorithm that solves the problem, then graphically model the structure and finally write the code in the programming
language and Double-linked lists, although they consume more space, offer a greater facility for traversing them by allowing sequential access in both directions.

Key words: Programming, data structures, lists, linked lists, arrays, dynamic arrays.