insertion sort - Difference using lists -


What is the difference between the composition of an inclusion using arrays and using linked lists?

To apply the insertion point to the list, do we use the algorithm for the arrays and just change the command A (K) = A (K + 1)?

What are the differences?

not another difference

array elements The index is used extensively, while the list elements will be accessed by going to the next node. Depending on the programming language, the syntax may vary.


Comments