Daa........

Question

What is the ans and give reason

Answer 1

A) greedy approach...

because at every step you are greedy to find smallest element...

Comments

I agree with @joshi_nitish

---

Sir, I think bubble sort is also an example of greedy approach.Right?

---

@rajatmyname, why would bubble sort be greedy? What are you being greedy for in this sort?

---

The largest element are always being arranged after every pass like selection sort for minimum, bubble sort for maximum. Is it not correct?

---

I think bubble sort is a brute force algorithm as we are just swapping the elements everytime, we aren't choosing anything.

---

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 

---

Ok. Thanks