Question One:

What is the complexity of the given code as a function of the problem size n? Show the (complete) details of your analysis. This is a Complexity Analysis, not a Complexity Estimation. You must follow the process, considering the Best Case, Worst Case and Average Case.

Note: a[i] is an array with n elements.

for (int i = 0; i 0.25) if (i%4 == 0) BubbleSort (a[i]); else QuickSort (a[i]); else for (int j = i; j

Bubble Sort (Straight Exchange Sort) public static void bubbleSort (int[] ar) int arTemp; for (int j = ar.length; i > 0; i--) for (int i = 1; i 0; i--) for (int i = 1; i