Arrays Pseudocode

1procedure ARRAY_TRAVERSAL(A)
2  for i ← 0 to length(A) - 1 do
3    visit A[i]
4  end for
5end procedure

1procedure LINEAR_SEARCH(A, key)
2  for i ← 0 to length(A) - 1 do
3    if A[i] = key then
4      return i
5    end if
6  end for
7  return −1
8end procedure

1procedure INSERT_AT(A, n, index, value)
2  // A has capacity ≥ n + 1
3  for i ← n down to index + 1 do
4    A[i] ← A[i − 1]
5  end for
6  A[index] ← value
7  // new length becomes n + 1
8end procedure

1procedure DELETE_AT(A, n, index)
2  value ← A[index]
3  for i ← index to n − 2 do
4    A[i] ← A[i + 1]
5  end for
6  // logical shrink: new length becomes n − 1
7  return value
8end procedure