What are Arrays in Data Structures?

An array can be defined as a finite ordered set of homogeneous elements. By the term ‘finite’ means that there are a specific number of elements in an array. By the term ‘ordered’ we mean that elements of array are arranged in a sequence so that first, second, third, ……… , nth element can be identified. The ‘homogeneous’ property of array means that all elements in the array must be of the same type.

Operations

The operations perform on array are:

• Traversal: Processing each element in the list. 
• Search: Finding the location of the element with a given value. 
• Insertion: Adding a new element to the list. 
• Deletion: Removing an element from the list. 
• Sorting: Arranging the elements in some type of order. 
• Merging: Combining two lists into a single list.