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 Algorithms space-complexity sorting algorithms test-series + – parulnabi asked Sep 2, 2016 • retagged Jul 8, 2022 by Lakshman Bhaiya parulnabi 601 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Both selection and Insertion sort requires O(1) cse23 answered Sep 2, 2016 cse23 comment Share Follow See all 2 Comments See all 2 2 Comments reply diksha kahensa commented Sep 27, 2016 reply Follow Share This question is asked in ace test series. There they mention the correct answer is: Quick Sort Plz expln. 0 votes 0 votes Pankaj kumar commented Sep 27, 2016 reply Follow Share there is no requirement of stack and extra array space for selection and insertion sort 0 votes 0 votes Please log in or register to add a comment.