1 votes 1 votes What is the ans and give reason Algorithms sorting algorithm-design-technique test-series + – Dharam raj asked Jul 12, 2017 • retagged Jul 13, 2022 by makhdoom ghaya Dharam raj 716 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 3 votes 3 votes A) greedy approach... because at every step you are greedy to find smallest element... joshi_nitish answered Jul 12, 2017 • selected Jul 13, 2017 by vamsi2376 joshi_nitish comment Share Follow See all 7 Comments See all 7 7 Comments reply minex let's go commented Jul 12, 2017 reply Follow Share I agree with @joshi_nitish 0 votes 0 votes rajatmyname commented Mar 18, 2018 reply Follow Share Sir, I think bubble sort is also an example of greedy approach.Right? 0 votes 0 votes Sukannya commented Mar 18, 2018 reply Follow Share @rajatmyname, why would bubble sort be greedy? What are you being greedy for in this sort? 0 votes 0 votes rajatmyname commented Mar 19, 2018 reply Follow Share The largest element are always being arranged after every pass like selection sort for minimum, bubble sort for maximum. Is it not correct? 0 votes 0 votes Sukannya commented Mar 19, 2018 reply Follow Share I think bubble sort is a brute force algorithm as we are just swapping the elements everytime, we aren't choosing anything. 1 votes 1 votes akshat sharma commented Mar 19, 2018 reply Follow Share yes bubble sort is brute force and coming to the selection sort at every pass e will find 1 min then swap with number (if possible) Although they both are comaparison based sorting algo 0 votes 0 votes rajatmyname commented Mar 19, 2018 reply Follow Share Ok. Thanks 0 votes 0 votes Please log in or register to add a comment.