What is the bigO time estimate of the following methods of n?

public static void swap (int[] a) {

int i = 0;

int j = a.length - 1;

while (i < j) {

int temp = a[i];

a[i] = a[j];

a[j] = temp;

i++;

j--;

}

}

public static boolean duplicate(int[] a) {

for (int i =0; i < a.length; ++i)

for (int j = i + 1; j < a.length; ++j)

for (int k = j +1; k < a.length; ++k) {

if (a[i] == a[j] && a[j] == a[k])

{ return true; }

}

return false;

}