How is the time and space complexity of an array operation determined?

The time complexity of an array operation indicates how much time is needed to perform it depending on the size of the array (usually denoted as O(n), where n is the number of elements). The space complexity shows how much additional memory is required to perform the operation.

For example, when searching for an element in an unsorted array, the time complexity will be O(n), since each element must be checked, and the space complexity is O(1) if no additional memory is used.