Insertion and deletion of elements require to move every element from their initial positions. This will become tedious. For Record collection, locality of reference and Ideal Cache behaviour we can use parallel arrays.

Since the array is sorted, binary search is preferred as its time complexity is O(logn).

Elements in the parallel array are accessed sequentially as one arrays holds the keys whereas other holds the values. This sequential access generally improves Locality of Reference. It is an advantage.

Different arrays can be of different data types but should contain same number of elements. Elements at corresponding index belong to a record.

The array can be sorted in any way, numerical, alphabetical or any other way but the elements are placed at equally spaced addresses.

All the arrays must have equal length, that is, contain same number of elements.

Sorted arrays have widespread applications as all commercial computing involves large data which is very useful if it is sorted. It makes best use of locality of reference and data cache. Linked lists are used in Hash Tables not arrays.