QUESTION 10 What does the following function f do? (a is an array, n is the size of the array) void f(int all, int n) {

[answerhappygod]

Question 10 What Does The Following Function F Do A Is An Array N Is The Size Of The Array Void F Int All Int N 1 (37.29 KiB) Viewed 22 times

QUESTION 10 What does the following function f do? (a is an array, n is the size of the array) void f(int all, int n) { int i; for (i=0;i<n;i++) swap(a, a[n-i-1]); 1 It reverses array a. It makes NO change to array a. It shifts all the numbers by 1. It swaps the first and the last elmenet of array a. QUESTION 11 Which of the following sorting algorithms requires most amount of additional memory? merge sort quick sort selection sort insertion sort QUESTION 12 Which of the following sorting algorithms has the best best case complexity? merge sort insertion sort selection sort quick sort