In the given problem, number of candidates is less but the number of votes is significantly large. For this problem we can use counting sort. Consider the sorting algorithms: Bubble Sort, Insertion...

In the given problem, number of candidates is less but the number of votes is significantly large. For this problem we can use counting sort.

Consider the sorting algorithms: Bubble Sort, Insertion Sort, Selection Sort, Merge Sort, Heap Sort, and Quick Sort. Which of these are stable?