1 votes 1 votes closed with the note: Ans. (4) Both S1 and S2. Which of the following statements are correct?S1: Binary search on array take less time than binary search on linked list.S2: Merge sort on array has more space complexity than merge sort on linked list. Only S1 Only S2 Both S1 and S2 Neither S1 nor S2 ** Here my doubt is, In S1 should i assume here that array is sorted. Answer given as Both S1 and S2. DS algorithms made-easy-test-series test-series + – Sandeep Singh asked Dec 27, 2015 • retagged Jun 4, 2017 by Arjun Sandeep Singh 606 views comment Share Follow See 1 comment See all 1 1 comment reply Arjun commented Dec 27, 2015 reply Follow Share yes, binary search being given you can assume data is sorted. 1 votes 1 votes Please log in or register to add a comment.