Brute force có phải là thuật toán heuristic năm 2024

When you need to solve a problem with code, you often have to choose between different types of algorithms. Two common categories are brute force and heuristic algorithms. But what are the differences between them, and how do you decide which one to use? In this article, you will learn about the advantages and disadvantages of both approaches, and some examples of problems that can be solved with them.

Top experts in this article

Selected by the community from 11 contributions. Learn more

• The brute force algorithms solve a problem by going through all possible candidates for the solution. Instead of using clever techniques to improve efficiency, they solve questions in a more general and straightforward way. As a result, the brute force algorithms are usually easy to design and implement, but not very efficient especially when dealing with large inputs. I believe starting with a brute-force solution can provide insight towards a better algorithm.
• Brute force exhaustively considers all solutions, guaranteeing optimality but often inefficient for large problems. Heuristic algorithms, employ rules of thumb, prioritize efficiency, and provide quick but approximate solutions. Brute force is deterministic, while heuristics can be deterministic or probabilistic. Memory usage differs, with brute force potentially requiring more. Examples include brute force for the Traveling Salesman Problem and heuristics like greedy algorithms for optimization. The choice depends on problem size, resources, and the trade-off between solution quality and computational speed.
• consider a pin code of 4 digits, the possible pin codes will be from 0001 to 9999. brute force attack will simply try all these possible passwords in a short span of time.
• In my coding experience, I recently grappled with a brute force algorithm while tackling a problem involving the arrangement of elements under certain constraints. While the approach ensured correctness, its inefficiency became evident as the input size increased. This resonates with the classic example of finding the shortest path between two cities, where a brute force algorithm would need to explore millions or billions of combinations. The trade-off between simplicity and efficiency prompted a shift towards more optimized algorithms for larger datasets, highlighting the practical challenges of relying solely on brute force in complex scenarios.
• Heuristic algorithms offer a fascinating contrast to brute force, and I recently found their effectiveness in a project involving route optimization. While working on a logistics application, the task was to find the most efficient delivery routes for a fleet of vehicles. Implementing a heuristic algorithm allowed us to significantly reduce computation time and resources. By leveraging information about traffic patterns and historical data, the algorithm intelligently prioritized routes, avoiding exhaustive exploration. Although it didn't guarantee an optimal solution, the trade-off between speed and optimality proved vital in meeting real-world operational demands.
• The first time I learnt about heuristic algorithms was when I looked into the traveling salesman problem. I was amazed how almost impossible it got when you have 10 cites/nodes and then your only practical solution becomes heuristic algorithms and they get pretty close to the most efficient solution.

Examples of brute force algorithms

Brute force algorithms are commonly used in many situations. For example, linear search is used to find an element in a list by checking every element one by one until it is found or the end of the list is reached. Selection sort is used to sort a list by finding the smallest element and swapping it with the first element, then repeating this process with the remaining elements until the list is sorted. Permutation generation relies on swapping each element with every other element and recursively generating the permutations of the rest of the elements to generate all possible permutations of a set of elements.

• In practical coding scenarios, I've frequently encountered the use of brute force algorithms in various applications. For instance, in implementing a linear search algorithm, the simplicity of checking each element one by one proved effective for finding a specific element in a list. Similarly, when tasked with sorting a list, the straightforward approach of selection sort, repeatedly finding the smallest element and swapping it with the first, demonstrated the essence of a brute force technique.

Examples of heuristic algorithms

Heuristic algorithms are a type of problem-solving technique that relies on an educated guess to find a solution. Binary search is an example of a heuristic algorithm, which is used to locate an element in a sorted list by comparing it with the middle element and eliminating half of the list depending on its size. Quick sort is another example, which sorts a list by choosing a pivot element and partitioning it into two sublists based on the elements’ size. Lastly, A* search is a heuristic algorithm used to find the shortest path between two nodes in a graph. It works by using a priority queue to store the nodes based on their distance from the start node and an estimate of their distance from the end node, then exploring each node's neighbors until the end node is reached or the queue is empty.

• Heuristic algorithms play a crucial role in various problem-solving scenarios, and I've encountered their efficacy in diverse applications. Binary search stands out as a classic example, where the algorithm intelligently narrows down the search space by comparing the target element with the middle element of a sorted list, efficiently eliminating half of the options based on the result. Quick sort, another heuristic gem, strategically partitions a list using a pivot element, providing a faster alternative to traditional sorting methods.
• Navigating the choice between brute force and heuristic algorithms demands a thoughtful evaluation aligned with the specific characteristics of the problem at hand. For smaller problem sizes with finite solution spaces and a requirement for optimal solutions, the simplicity and guarantee of correctness associated with brute force algorithms make them a suitable choice. Conversely, in scenarios involving larger problem sizes, infinite or exponential solution spaces, and where an approximate solution suffices, heuristic algorithms shine with their efficiency. It's crucial to weigh factors such as time and space complexity, correctness and completeness, as well as the elegance of the solution.
• This trick is based on the constraints given in the problem statement, which are the limits on the input size and values. Here is the trick: 🎁 If n ≤ 12, you can use O (n!) algorithms, such as permutations of 1 … n If n ≤ 25, you can use O (2^n) algorithms, such as all subsets of an array of size n If n ≤ 100, you can use O (n^4) algorithms, such as 4Sum If n ≤ 500, you can use O (n^3) algorithms, such as all triangles with side length less than n If n ≤ 10^4, you can use O (n^2) algorithms, such as bubble sort If n ≤ 10^5, you can use O (n log n) algorithms, such as merge sort If n ≤ 10^6, you can use O (n) algorithms, such as linear search If n > 10^6, you can use O (log n) or O (1) algorithmsOf course, this is not a hard and fast rule
• Choosing between a heuristic vs brute force approach doesn’t have to be one-size-fits-all ultimatum for the lifetime of a project. You can build out a proof of concept or MVP for a project with a brute force approach knowing you can transition to a heuristic driven approach for deployment. To quickly iterate you have to build quickly, and that might mean a less than optimal solution with a higher runtime while you’re testing as long as you know there’s a scalable path forward once the idea is proven.

Software Development

Software Development

Rate this article

We created this article with the help of AI. What do you think of it?

Thanks for your feedback

Your feedback is private. Like or react to bring the conversation to your network.

Report this article

See all

More relevant reading

Help improve contributions

Mark contributions as unhelpful if you find them irrelevant or not valuable to the article. This feedback is private to you and won’t be shared publicly.