Question 11497 – APPSC-2012-DL CA
March 27, 2024Question 11499 – APPSC-2012-DL CA
March 27, 2024Question 11498 – APPSC-2012-DL CA
In which sorting algorithm average number of comparison is (n2 – n) / 2?
Correct Answer: A
Question 28 Explanation:
Insertion sort have average no. of comparisons (n2 – n) / 2.
Insertion sort
Selection sort
Merge sort
Quick sort