hamaliya
ARRAY Traversing ALGORITHM:
This can be accomplished by traversing A, that is, by accessing and processing
each element of A exactly once.
5. Exit.
ARRAY Insertion
Inserting an element at end of linear array can be done easily if the array is large
enough to accommodate new item.
If the element is to be inserted in the middle of array then half members must be
moved downward to new location to accommodate new element by keeping the
order of other elements
Algorithm for Insertion: (Inserting into Linear Array) INSERT (LA, N, K, ITEM)
7. EXIT.
2. Repeat for J = K to N 1.
[End of loop]
4. EXIT