What is the Big Oh of method1 Is there a best case and a worst case public static void

Chapter 4, Problem 14

(choose chapter or problem)

What is the Big Oh of method1? Is there a best case and a worst case? public static void method1(int[] array, int n) { for (int index = 0; index < n - 1; index++) { int mark = privateMethod1(array, index, n - 1); int temp = array[index]; array[index] = array[mark]; array[mark] = temp; } // end for } // end method1 public static int privateMethod1(int[] array, int first, int last) { int min = array[first]; int indexOfMin = first; for (int index = first + 1; index <= last; index++) { if (array[index] < min) { min = array[index]; indexOfMin = index; } // end if } // end for return indexOfMin; } // end privateMethod1