which is not a stable sorting algorithm it's typical implementation
Answers
Answered by
1
Answer:
Merge sort is a stable algorithm but not an in-place algorithm. It requires extra array storage. Quicksort is not stable but is an in-place algorithm. Heap sort is an in-place algorithm but is not stable.
Answered by
3
Answer:
Merge sort is a stable algorithm but not an in-place algorithm. It requires extra array storage. Quicksort is not stable but is an in-place algorithm. Heap sort is an in-place algorithm but is not stable.
Similar questions