in Algorithms retagged by
442 views
0 votes
0 votes
Which of the following algorithm has the smallest memory requirement, including data space and run time stack for recursive calls?

A. Insertion Sort

B. Quick Sort

C. Selection Sort

D. Merge Sort
in Algorithms retagged by
442 views

1 Answer

0 votes
0 votes
Both selection and Insertion sort requires O(1)
by

2 Comments

This question is asked in ace test series. There they mention the correct answer is: Quick Sort

Plz expln.
0
0
there is no requirement of stack and extra array space for selection and insertion sort
0
0