Consider the following array:
Which algorithm out of the following options uses the least number of comparisons (among the array elements) to sort the above array in ascending order?

- ASelection sort
- BMergesort
- CInsertion sort
- DQuicksort using the last element as pivot

