Reverse an array in-place. What is the time and space complexity?

void reverse(int[] a) {
  int l = 0, r = a.length - 1;
  while (l < r) {
    int tmp = a[l]; a[l] = a[r]; a[r] = tmp;
    l++; r--;
  }
}