10,756 views
0 votes
0 votes

State True or False for internal sorting algorithms:
(i) Internal sorting are applied when the entire collection if data to be sorted is small enough that the sorting can take place within main memory.
(ii) The time required to read or write is considered to be significant in evaluating the performance of internal sorting.
A. (i)- True, (ii)- True

B. (i)- True, (ii)- False

C. (i)- False, (ii)- True

D. (i)- False, (ii)- False

2 Answers

Best answer
4 votes
4 votes
Internal sorting . when the elements to be sorted are all in the main memory while in external sort all are not present in memory during sorting . as in internal sort all elements are in main memory the time to read write is not that much significant as compared to external sorting .

so true false
selected by
0 votes
0 votes
Internal sorting algorithms somewhat like in-place algorithm. It's only for understanding. The internal sorting algorithm takes place only in main memory. They don't don't need external memory for sorting.

Read and write is not very significant in calculating the time complexity.

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...