What sorting algorithm is implemented by the following function?

Question

public class another {
public void sort(int arr[], int begin, int end) {
if (begin < end) {
int partitionIndex = partition(arr, begin, end);
sort(arr, begin, partitionIndex-1);
sort(arr, partitionIndex+1, end);
}
}
}
a. Quick sort
b. Bubble Sort
c. Merge sort
d. Selection sort

Answer 1

a. Quick sort
This is an implementation of the quick sort algorithm. Quick sort is a divide-and-conquer algorithm. It first divides a large array into two smaller subarrays: the low elements and the high elements. It then recursively sorts the subarrays.