Question

Strange Sort In a dumpster outside MEB, I found a scrap of paper with this Java implementation of a sorting algorithm on it: // This will get me the Turing Award for sure!! public static void sort (int[] A) { sort (A, O, A.length); // Sorts the subarray Allo .. hi-1] into ascending order private static void sort (int[] a, int lo, int hi) { int size = hi - lo; if (size == 2) { if (A[lo] > A[10+1]) { int temp = A[lo]; A[lo] = A[lo+1]; A[lo+1) = temp; else if (size > 2) { int chunk = size / 3; sort (A, lo, hi-chunk); sort (A, lo+chunk, hi); sort (A, lo, hi-chunk);

Answer 1

Please find the answers below.

7. Do Dame Foo TO)= a T("/6) + 069) o a=3 because we call 2) b = 3/2 because, we we call sortes3 times 31. because, que col) (lo to hi-chunk] (26) F ? (lo to him, 2. Total T("/b) = T (2/3) ie., b = ½

6. Era 7. Do not ca 8. Throw the used 9. Ensure to keep the Note: For any domestic help. Food Tin Snacks 5.0 pm to to 1:3 Lunch p TW) = a T\/b+ 060) a=3 because we call we call sortes3 times Breakfast ham to da 0 n el because we perform constant no. of Operations u) master theorem: - с = 0 log a = logo log = 2.909 since caloga ie. O < 2.209 complexity = O(n loga) 20 (62.909) 50 (13)

5. It is put in the trash because The TIME COMPLEXITY is O(n³) which is very high. We already have algorithms with O(N logN) time which are very less time compared to our algorithm..!!!!

If there are any doubts, comment down here. We are right here to help you. Happy Learning..!! PLEASE give an UPVOTE I Have Put a lot of EFFORT in solving Your Problem. It really Boosts us..!! PLEASE give an UPVOTE I Have Put a lot of EFFORT in solving Your Problem. , It really Boosts us..!!