Register

Self Doubt Algorithms

• retagged by
346 views
0 votes
0 votes
When relative ordering of equal keys is preserved after sorting then it is called stable.  

Quick sort and heap sort  is not a stable sorting algorithm .  Doubt---IS Selection sort not a stable sorting algorithm  ?
• retagged by
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
tusharb asked Feb 18, 2022
695 views
Algorithm self doubt
As we know the time complexity of solving the greedy knapsack algorithm depends mainly on the sorting algorithm used, Can we use counting sort as the sorting algorithm to reduce the time complexity to O(n)?
As we know the time complexity of solving the greedy knapsack algorithm depends mainly on the sorting algorithm used, Can we use counting sort as the sorting algorithm to...
User Avatar
1 votes
1 votes
1 answer
2
afroze asked Nov 4, 2021
572 views
Self doubt
what is significance of loop Invariant? when we use a loop in an algo we check it , if it properly runs then fix it in that, then why do check separately loop invariant ?
what is significance of loop Invariant?when we use a loop in an algo we check it , if it properly runs then fix it in that, then why do check separately loop invariant ?
User Avatar
1 votes
1 votes
1 answer
3
kumar.dilip asked Jan 19, 2019
685 views
Self Doubt
The average no. of comparisons performed by the merge sort algorithm, in merging 2 sorted lists of length 2 is___________. Ans: $\frac{8}{3}$
The average no. of comparisons performed by the merge sort algorithm, in merging 2 sorted lists of length 2 is___________.Ans: $\frac{8}{3}$
User Avatar
Link Copied!