What is difference …
 
Notifications
Clear all

What is difference between greedy and brute force approach in algorithms?

1 Posts
2 Users
0 Likes
588 Views
0
Topic starter

please explain with example.

1 Answer
0

In direct comparison, the outcome of the alternative Greedy algorithm is more efficient in terms of calculation time whereas the Brute Force method provides the combination with the global optimum. This means calculation time as well as quality of outcome differ.

Share: