recategorized by
2,330 views

1 Answer

1 votes
1 votes
i think it should be heapsort because time complexity is O(n log n) and space complexity is O(1)

Related questions

1 votes
1 votes
1 answer
1
radha gogia asked Jul 16, 2015
812 views
I am not getting which algorithm has minimum no of swap operations , acc to me both selection and insertion should be at the lowest level as well as merge sort since afte...
0 votes
0 votes
2 answers
2
_Madhuri asked Oct 9, 2021
631 views
The complexity of comparison based sorting algorithm is (nlogn) .How?
0 votes
0 votes
0 answers
3
0 votes
0 votes
2 answers
4
rahul sharma 5 asked Dec 8, 2017
1,000 views
Which of the following sorting techniques have best time complexity, if complexity is measured in terms of number of comparison? A Insertion sortB Selection sortC Merge s...