edited by
296 views

1 Answer

1 votes
1 votes

Some example of Stable Sort

1.Insertion Sort

2.Bubble sort

3.Merge Sort

4.Count Sort

Some example of Unstable Sort

1.Heap Sort

2.Selection Sort

3.Quick Sort

Answer:

Related questions

0 votes
0 votes
1 answer
1
admin asked Jan 5, 2019
496 views
Which one of the following algorithms cannot sort $n$ numbers in $O(n)$ comparisons?Counting sortRadix sortHeap sortBucket sort
0 votes
0 votes
1 answer
2
admin asked Jan 5, 2019
296 views
The recurrence equation $T(n) = T(\sqrt{n}) + O(1)$ has the following asymptotic solution:$T(n) = O(\sqrt{n})$$T(n) = O(\log n)$$T(n) = O(n^{1/\log n})$$T(n) = O(\log \lo...
0 votes
0 votes
0 answers
3
admin asked Jan 5, 2019
218 views
The Adjacency matrix of a directed graph $\text{G}$ is given below.$\begin{array} {} & a & b & c & d & e & f & g & h & i \\ a & 0 & 1 & 0 & 0 & 0 & 0 & 1 & 0 & 0 \\ b & ...
0 votes
0 votes
1 answer
4
admin asked Jan 5, 2019
398 views
An unordered list contains $n$ distinct elements. The number of comparisons to find an element in the list that is larger than the second minimum in the list is$\Theta(n ...