Explain array implementation of list.

Question

Suresh Chand · Accepted Answer

To implement a list, We need to define large array to hold al the items of the list. The first item of the list is placed 0th position of array and successive items in successive positions of the array. The operation of insertion and deletion of the items can be done to/from anywhere wwithin the list. Implementation: For array implementation, let first we make assumptions for some user-defined jeywords that we are going to use further. N be the maximum number of elements/items in  an array. array[N] be an array to hold the items of lists. last_index is deined to indicate index of the last element. Initially, last_index = -1 Now, we perform array implemenattion for operations insertion and deletion as follow: 1. Insertion: Read the position pos to insert If pos > last_index + 1, declare invalid and return. let i = last_index while (i > pos) array[i+1] = array[i]; array[pos] = x; Incement last_index 2. Deletion: Read position pos to delete If pos > last_index, declare invald and return x = array[pos] i = pos; while( i < last_index) array[i]=array[i+1]; i = i+1; Decrement last_index

Explain array implementation of list.

Leave your Answer:

Hits Counter

Question

Explain array implementation of list.

Leave your Answer: