Brute Force vs Greedy: two approaches compared

Brute Force vs Greedy header

Algorithmic problem solving is a fundamental element in computer science, requiring the application of efficient strategies to obtain optimal or acceptable solutions in terms of time and space. Two distinct approaches in this context are known as Brute Force and Greedy. These represent two ends of the algorithmic complexity spectrum, each with its own advantages and limitations.

[wpda_org_chart tree_id=44 theme_id=50]

Brute Force and Greedy methods

The Brute Force method involves exhaustively exploring all possible solutions to a problem, without making heuristic assumptions about the nature of the problem itself. This strategy can be particularly useful for solving small problems, ensuring that you get the right solution. However, it can become impractical on larger problems, requiring significant computational resources.

On the other hand, the Greedy approach relies on locally optimal choices to gradually build a solution. At each step, the greedy chooses the best available option in the hope of obtaining a globally optimal solution. This approach is often more efficient than brute force, but can lead to suboptimal solutions if it is not carefully designed.

In this article, we will explore both techniques in detail through practical examples implemented in Python. From applications of brute force in solving complex combinatorial problems, to the use of greedy strategies to address optimization questions, our goal is to understand when and how to apply these techniques to obtain effective and suitable solutions to different algorithmic challenges.

Combining theory and practice, we will immerse ourselves in the fascinating world of brute force and greedy algorithms, enriching our skills in efficiently solving algorithmic problems using the Python programming language.

Brute force

The brute force method is an algorithmic technique that solves a problem by examining all possible solutions systematically, without using heuristics or optimization strategies. The main idea is to explore all possible combinations of inputs until the desired solution is found.

Main features of Brute Force:

  1. Full Exploration:

Brute force examines all possible solutions without making any assumptions about the nature of the problem.

This approach is particularly useful when the size of the problem is manageable and when it is necessary to ensure the correctness of the solution.

  1. High Time Complexity:

Because brute force examines all combinations, its time complexity can grow exponentially with the size of the problem.

This makes the approach impractical for large problems.

  1. Correctness Guarantee:

Despite the high complexity, brute force guarantees the correctness of the solution because it examines all possible options.

  1. Common Applications:

Brute force is often used to solve combinatorial problems, such as finding all possible combinations of a set of elements or finding subsets that satisfy certain conditions.

Brute Force Example: Sum of Subsets

def brute_force_subset_sum(nums):
    n = len(nums)
    total_sum = 0

    # Iterate through all possible subsets
    for i in range(1 << n):
        subset = [nums[j] for j in range(n) if (i & (1 << j)) > 0]
        total_sum += sum(subset)

    return total_sum

In the example above, the function calculates the sum of all subsets of an array of numbers generating all possible binary combinations of the elements.

Suppose we have the array of numbers [1, 2, 3] and we want to calculate the sum of all possible subsets. We will use the brute_force_subset_sum function we just defined:

array_of_numbers = [1, 2, 3]
result = brute_force_subset_sum(array_of_numbers)

print(f"Array of numbers: {array_of_numbers}")
print(f"Sum of all possible subsets: {result}")

In this case, the program will generate all possible subsets of the array [1, 2, 3] and calculate the sum of each of them. The result will be the total sum of all possible subsets.

Expected output:

Array of numbers: [1, 2, 3]
Sum of all possible subsets: 24

The algorithm examines all subsets (empty, [1], [2], [3], [1, 2], [1, 3], [2, 3], [1, 2, 3]) and calculates the sum of each of them, obtaining the total sum of 24.

Brute force, while having limitations in terms of computational efficiency, is essential for small problems or when it is essential to guarantee the correctness of the solution.


The Greedy method is an algorithmic approach that makes locally optimal choices at each step, with the goal of building a global solution. Unlike brute force, the greedy method does not explore all possible solutions, but makes choices that seem best at the time, in the hope that they will lead to an overall optimal solution. The decisions made in each step are irrevocable.

Main features of the Greedy Method:

  1. Locally Optimal Choices:

At each step, the greedy method makes a choice that appears to be the best at that moment, based on local information.

It does not consider the long-term consequences of the choices made at each step.

  1. Does Not Guarantee the Overall Optimal Solution:

While the greedy method may lead to optimal solutions in some cases, there is no guarantee that the overall solution will be the best possible.

It can lead to suboptimal solutions in some contexts.

  1. Execution Speed:

In many cases, the greedy method is faster than brute force because it does not explore all possible solutions.

It can be effective in situations where the optimal solution can be obtained by making locally optimal choices.

  1. Common Applications:

The greedy method is often used for optimization problems, such as the money change problem, the selection of tasks in an agenda, or the shortest path problem.

Example of Greedy Method: Minimum Coin Algorithm

def minimum_coin_change(change, coins):
    solution = []
    remaining_change = change

    for coin in coins:
        while remaining_change >= coin:
            remaining_change -= coin

    return solution

In this example, the minimum_coin_change function uses the greedy algorithm to return the change of a specified amount (change) with the smallest possible number of coins, using a list of available coins (coins).

Certainly! Suppose you need to return change in the amount of 27 units using available coins [1, 5, 10, 25]. We will use the minimum_coin_change function that we defined previously:

amount = 27
available_coins = [1, 5, 10, 25]
result = minimum_coin_change(amount, available_coins)

print(f"Amount: {amount}")
print(f"Available coins: {available_coins}")
print(f"Minimum coins for change: {result}")

In this case, the program will use the greedy algorithm to return the change of 27 using as few coins as possible among [1, 5, 10, 25]. The result will be the list of coins used to compose the minimum exchange rate.

Expected output:

Amount: 27
Available coins: [1, 5, 10, 25]
Minimum coins for change: [25, 1, 1]

The greedy algorithm selects the largest possible coin in each step to reduce the remaining amount until reaching the minimum required exchange rate. In our case, returning 27, it selects a 25 coin, a 1 coin and another 1 coin, thus obtaining the minimum exchange rate.

The greedy method, if applied correctly, can be an effective alternative to brute force in situations where locally optimal choices lead to globally acceptable solutions.


Both techniques have their appropriate uses. Brute force ensures correctness but can be ineffective on large problems. Greedy is fast but can produce suboptimal solutions. The choice between the two depends on the context of the problem and the specific requirements.

Leave a Reply