Answer:
contiguous.
Explanation:
An array can be defined as a set of memory locations (data structure) that comprises of a group of elements with each memory location sharing the same name. Therefore, the elements contained in array are all of the same data type e.g strings or integers.
Basically, in computer programming, arrays are typically used by software developers to organize data, in order to search or sort them.
Binary search is an efficient algorithm used to find an item from a sorted list of items by using the run-time complexity of Ο(log n), where n is total number of elements.
Binary search applies the principles of divide and conquer.
In order to do a binary search on an array, the array must first be sorted in an ascending order.
The array elements are always stored in contiguous memory locations.
It should be be noted that the array elements are always stored in contiguous memory locations.
According to the question, we are to discuss the array elements and how they are been always stored .
As a result if this we can see that array elements are always stored in contiguous memory locations so as to enable the retrieval of the information.
Therefore, array elements are always stored in contiguous memory locations.
Learn More about array elements at;
https://brainly.com/question/3735128
