0 votes 0 votes Algorithms algorithms sorting test-series + – Sanjay Sharma asked Jan 19, 2017 • retagged Jul 17, 2022 by makhdoom ghaya Sanjay Sharma 781 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes infact insertion sort can do it in O(n) time i think.. all others will take relativvely more time. Anusha Motamarri answered Jan 19, 2017 • edited Jan 19, 2017 by Anusha Motamarri Anusha Motamarri comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Rahul Jain25 commented Jan 19, 2017 reply Follow Share Make C) as the answrr 0 votes 0 votes Sushant Gokhale commented Jan 24, 2017 reply Follow Share Bubble sort should be the answer. Look at the statement: Adjacent numbers are interchanged Perfect for bubble sort . 1 pass - O(n) 1 votes 1 votes cse23 commented Jan 24, 2017 reply Follow Share ya exactly...Bubble sort will do in single pass 1 votes 1 votes Please log in or register to add a comment.