592 views
0 votes
0 votes
If the number of records to be sorted is small, then ...... sorting can be efficient.
A. Merge B. Heap
C. Insertion D. Bubble

And why?

Please log in or register to answer this question.

Related questions

0 votes
0 votes
2 answers
2
_Madhuri asked Oct 9, 2021
631 views
The complexity of comparison based sorting algorithm is (nlogn) .How?
1 votes
1 votes
1 answer
4
iarnav asked May 4, 2019
834 views
I’ve seen this wikipedia article – https://en.wikipedia.org/wiki/Comparison_sortAlso see this link – https://gateoverflow.in/32948/minimum-number-of-comparisonshttp...