Brute Force Approach and its pros and cons

Tutorials
- Python Tutorial
  - Taking Input in Python
  - Python Operators
  - Python Data Types
    - Python Numbers
    - Python String
    - Python Lists
    - Python Tuples
    - Sets in Python
    - Python Dictionary
  - Python Loops and Control Flow
    - Python Conditional Statements
    - Python Loops
  - Python Functions
  - Python OOPS Concept
  - Python Data Structures
    - Python DSA
    - Linked List
    - Stack
    - Queue
    - Tree
    - Heap
    - Hashing
    - Graph
    - Sets
    - Map
    - Advance Data Structure
    - Sorting Algorithms
    - Searching Algorithms
  - Python Exception Handling
  - Python File Handling
  - Python Exercises
    - Python List Exercise
    - Python String Exercise
    - Python Tuple Exercise
    - Python Dictionary Exercise
    - Python Set Exercise
    - Python Design Patterns
    - Python Programming Examples
    - Python Practice Questions
- Java
  - Java Programming Language
    - Java Tutorial
    - Data Types
    - Variables
    - Operators
    - Flow Control in Java
    - Loops in Java
    - Methods
    - Strings
    - Arrays
    - OOPs Concepts
      - OOPs Concepts
      - Classes and Objects
      - Access Modifiers
      - Inheritance
      - Abstraction
      - Encapsulation
      - Polymorphism
    - Interface
    - Packages
    - Multithreading
    - File Handling
    - Regular Expression
  - Java Collections
    - Java Collections
    - Collection Class
    - List Interface
    - ArrayList
    - LinkedList Class
    - Queue Interface
    - Set Interface
    - HashSet Class
    - Map Interface
    - HashMap Class
    - HashTable Class
    - Iterator
    - Comparator
    - Collection Interview Questions
  - Java 8 Tutorial
  - Java Programs
    - Java Programming Examples
    - Java Array Programs
    - Java String Programs
    - Java Date-Time Programs
    - Java File Handling Programs
    - Java Collection Programs
    - Java JDBC Programs
    - Java Apache POI Programs
    - Java OpenCV Programs
  - Java Interview Questions
    - Java Interview Questions
    - Core Java Interview Questions-Freshers
    - Java Multithreading Interview Questions
    - OOPs Interview Questions and Answers
  - Java Exercises
  - Java Quiz
    - Java Quiz
    - Core Java MCQ
  - Java Projects
  - Advance Java
    - Spring Tutorial
    - Spring Boot Tutorial
    - Spring Boot Interview Questions
    - Spring MVC Tutorial
    - Spring MVC Interview Questions
    - Hibernate Tutorial
    - Hibernate Interview Questions
- Programming Languages
  - C
  - C++
  - JavaScript
  - PHP
  - R Tutorial
  - C#
  - SQL
  - Scala
  - Perl
  - Go Language
  - Kotlin
- System Design
  - System Design Tutorial
    - What is System Design
    - Key Terminologies in System Design
    - Analysis and Architecture of Systems
    - Scalability in System Design
    - Databases in System Design
    - High Level Design or HLD
    - Low Level Design or LLD

DSA Course
DSA
Algorithms
Analysis of Algorithms
Sorting
Searching
Greedy
Recursion
Backtracking
Dynamic Programming
Divide and Conquer
Geometric Algorithms
Mathematical Algorithms
Pattern Searching
Bitwise Algorithms
Randomized Algorithms

Open In App

Last Updated : 18 Jan, 2024

Summarize

Comments

Improve

What is the Brute Force Algorithm?

A brute force algorithm is a simple, comprehensive search strategy that systematically explores every option until a problem’s answer is discovered. It’s a generic approach to problem-solving that’s employed when the issue is small enough to make an in-depth investigation possible. However, because of their high temporal complexity, brute force techniques are inefficient for large-scale issues.

Key takeaways:

Methodical Listing: Brute force algorithms investigate every potential solution to an issue, usually in an organized and detailed way. This involves attempting each option in a specified order.
Relevance: When the issue space is small and easily explorable in a fair length of time, brute force is the most appropriate method. The temporal complexity of the algorithm becomes unfeasible for larger issue situations.
Not using optimization or heuristics: Brute force algorithms don’t use optimization or heuristic approaches. They depend on testing every potential outcome without ruling out any using clever pruning or heuristics.

Features of the brute force algorithm

It is an intuitive, direct, and straightforward technique of problem-solving in which all the possible ways or all the possible solutions to a given problem are enumerated.
Many problems are solved in day-to-day life using the brute force strategy, for example, exploring all the paths to a nearby market to find the minimum shortest path.
Arranging the books in a rack using all the possibilities to optimize the rack spaces, etc.
Daily life activities use a brute force nature, even though optimal algorithms are also possible.

PROS AND CONS OF BRUTE FORCE ALGORITHM:

Pros:

The brute force approach is a guaranteed way to find the correct solution by listing all the possible candidate solutions for the problem.
It is a generic method and not limited to any specific domain of problems.
The brute force method is ideal for solving small and simpler problems.
It is known for its simplicity and can serve as a comparison benchmark.

Cons:

The brute force approach is inefficient. For real-time problems, algorithm analysis often goes above the O(N!) order of growth.
This method relies more on compromising the power of a computer system for solving a problem than on a good algorithm design.
Brute force algorithms are slow.
Brute force algorithms are not constructive or creative compared to algorithms that are constructed using some other design paradigms.

Conclusion

Brute force algorithm is a technique that guarantees solutions for problems of any domain helps in solving the simpler problems and also provides a solution that can serve as a benchmark for evaluating other design techniques, but takes a lot of run time and inefficient.

soubhikmitra98

Improve

Implementation of Elastic Net Regression From Scratch

ML | Implementation of KNN classifier using Sklearn

Please Login to comment...

Similar Reads

Difference between Brute Force and Dynamic Programming Brute Force: It gives a solution to a problem by using the most straightforward method. However, it is typically not a very optimal solution or one that is flexible for future changes, but it gets the job done. The proverbial brute force programming example is trying all optimal solutions for reaching the final answer.Brute force programming tests 6 min read Vertical Taversal using Brute Force Given a binary tree, print it vertically. The following example illustrates vertical order traversal. 1 / \ 2 3 / \ / \ 4 5 6 7 \ \ 8 9 The output of print this tree vertically will be: 4 2 1 5 6 3 8 7 9 The idea is to traverse the tree once and get the minimum and maximum horizontal distance with respect to root. For the tree shown above, mi 10 min read Program to find gravitational force between two objects Introduction to Gravitational Force We know that gravity is universal. According to Newton's Law of Universal Gravitation, all objects attract each other with a force of gravitational attraction. According to this law, the force of gravitational attraction is directly dependent upon the masses of both objects and inversely proportional to the squar 4 min read Count of Array elements greater than all elements on its left and next K elements on its right Given an array arr[], the task is to print the number of elements which are greater than all the elements on its left as well as greater than the next K elements on its right. Examples: Input: arr[] = { 4, 2, 3, 6, 4, 3, 2}, K = 2 Output: 2 Explanation: arr[0](= 4): arr[0] is the 1st element in the array and greater than its next K(= 2) elements {2 14 min read Construct Full Binary Tree using its Preorder traversal and Preorder traversal of its mirror tree Given two arrays that represent Preorder traversals of a full binary tree and its mirror tree, we need to write a program to construct the binary tree using these two Preorder traversals.A Full Binary Tree is a binary tree where every node has either 0 or 2 children. Note: It is not possible to construct a general binary tree using these two traver 12 min read Count of Array elements greater than all elements on its left and at least K elements on its right Given an array A[ ] consisting of N distinct integers, the task is to find the number of elements which are strictly greater than all the elements preceding it and strictly greater than at least K elements on its right. Examples: Input: A[] = {2, 5, 1, 7, 3, 4, 0}, K = 3 Output: 2 Explanation: The only array elements satisfying the given conditions 15+ min read Smallest N digit number with none of its digits as its divisor Given an integer N. The task is to find the smallest N digit number S, such that S is not divisible by any of its digits. Print -1 if no such number is possible.Examples: Input: N = 2 Output: 23 Explanation: 23 is the smallest two-digit number that is not divisible by any of its digits.Input: N = 1 Output: -1 Explanation: Every single digit number 10 min read Node having maximum number of nodes less than its value in its subtree Given a Binary Tree, the task is to find the node from the given tree which has the maximum number of nodes in its subtree with values less than the value of that node. In the case of multiple possible nodes with the same number of maximum nodes, then return any such node. Examples: Input: 4 / \ 6 10 / \ / \2 3 7 14 / 5 Output: 6Explanation:Node wi 10 min read Minimize cost to split an array into K subsets such that the cost of each element is its product with its position in the subset Given an array arr[] of size N and a positive integer K, the task is to find the minimum possible cost to split the array into K subsets, where the cost of ith element ( 1-based indexing ) of each subset is equal to the product of that element and i. Examples: Input: arr[] = { 2, 3, 4, 1 }, K = 3 Output: 11 Explanation: Split the array arr[] into K 7 min read Lexicographically largest array possible from first N natural numbers such that every repetition is present at distance equal to its value from its previous occurrence Given a positive integer N, the task is to construct the lexicographically largest array of size (2 * N - 1) comprising of first N natural numbers such that each element occurs twice except 1 and the repetition of X is exactly X distance apart in the constructed array. Examples: Input: N = 4Output: 4 2 3 2 4 3 1Explanation:For the generated array { 10 min read Kth smallest positive integer Y such that its sum with X is same as its bitwise OR with X Given two positive integers X and K, the task is to find the Kth smallest positive integer (Y) such that the sum of X and Y is equal to Bitwise OR of X and Y, i.e. (X + Y = X | Y) Examples: Input: X = 5, K = 1Output: 2Explanation:Consider the smallest number as 2. The sum of 2 and 5 is 2 + 5 = 7 and the Bitwise OR of 2 and 5 is 7. Input: X = 5, K = 6 min read Find GCD of all Array numbers for which its value is equal to its frequency Given an array arr[] of integers N, the task is to find the GCD of all numbers for which it's value is equal to its frequency in the array. Examples; Input: arr={2, 3, 4, 2, 3, 3} N=6 Output: 1Explanation: Here 2 is occurring 2 times and 3 is occurring 3 times. Hence GCD of 2, 3, is 1. So our output is 1. Input: arr={2, 3, 4, 4, 3, 5, 4, 4, 2, 8} N 6 min read Find the index having sum of elements on its left equal to reverse of the sum of elements on its right Given an array, arr[] size N, the task is to find the smallest index of the array such that the sum of all the array elements on the left side of the index is equal to the reverse of the digits of the sum of all the array elements on the right side of that index. If no such index is found then print -1. Examples: Input: arr[] = { 5, 7, 3, 6, 4, 9, 15+ min read Inorder predecessor and successor for a given key in BST | Iterative Approach Given a BST and a key. The task is to find the inorder successor and predecessor of the given key. In case, if either of predecessor or successor is not present, then print -1.Examples: Input: 50 / \ / \ 30 70 / \ / \ / \ / \ 20 40 60 80 key = 65 Output: Predecessor : 60 Successor : 70 Input: 50 / \ / \ 30 70 / \ / \ / \ / \ 20 40 60 80 key = 100 O 12 min read Merge K sorted arrays | Set 3 ( Using Divide and Conquer Approach ) Giving k sorted arrays, each of size N, the task is to merge them into a single sorted array. Examples: Input: arr[][] = {{5, 7, 15, 18}, {1, 8, 9, 17}, {1, 4, 7, 7}} Output: {1, 1, 4, 5, 7, 7, 7, 8, 9, 15, 17, 18} Input: arr[][] = {{3, 2, 1} {6, 5, 4}} Output: {1, 2, 3, 4, 5, 6} Prerequisite: Merge SortSimple Approach: A simple solution is to appe 15+ min read Merge K sorted arrays of different sizes | ( Divide and Conquer Approach ) Given k sorted arrays of different length, merge them into a single array such that the merged array is also sorted.Examples: Input : {{3, 13}, {8, 10, 11} {9, 15}} Output : {3, 8, 9, 10, 11, 13, 15} Input : {{1, 5}, {2, 3, 4}} Output : {1, 2, 3, 4, 5} Let S be the total number of elements in all the arrays.Simple Approach: A simple approach is to 8 min read Check if a Binary Tree is BST : Simple and Efficient Approach Given a Binary Tree, the task is to check whether the given binary tree is Binary Search Tree or not.A binary search tree (BST) is a node-based binary tree data structure which has the following properties. The left subtree of a node contains only nodes with keys less than the node's key.The right subtree of a node contains only nodes with keys gre 6 min read Maximum profit by buying and selling a share at most K times | Greedy Approach In share trading, a buyer buys shares and sells on a future date. Given the stock price of N days, the trader is allowed to make at most K transactions, where a new transaction can only start after the previous transaction is complete. The task is to find out the maximum profit that a share trader could have made. Examples: Input: prices[] = {10, 2 11 min read How does Floyd's slow and fast pointers approach work? We have discussed Floyd's fast and slow pointer algorithms in Detect loop in a linked list. The algorithm is to start two pointers slow and fast from the head of the linked list. We move slow one node at a time and fast two nodes at a time. If there is a loop, then they will definitely meet. This approach works because of the following facts : When 4 min read Largest number less than or equal to N in BST (Iterative Approach) We have a binary search tree and a number N. Our task is to find the greatest number in the binary search tree that is less than or equal to N. Print the value of the element if it exists otherwise print -1. Examples: For the above given binary search tree- Input : N = 24 Output :result = 21 (searching for 24 will be like-5->12->21) Input : N 7 min read Add 1 to number represented as array | Recursive Approach Given an array which represents a number, add 1 to the array. Suppose an array contain elements [1, 2, 3, 4] then the array represents decimal number 1234 and hence adding 1 to this would result 1235. So new array will be [1, 2, 3, 5]. Examples: Input : [1, 2, 3, 4] Output : [1, 2, 3, 5] Input : [1, 2, 9, 9] Output : [1, 3, 0, 0] Input: [9, 9, 9, 9 6 min read Deepest left leaf node in a binary tree | iterative approach Given a Binary Tree, find the deepest leaf node that is left child of its parent. For example, consider the following tree. The deepest left leaf node is the node with value 9. Examples: Input : 1 / \ 2 3 / / \ 4 5 6 \ \ 7 8 / \ 9 10 Output : 9 Recursive approach to this problem is discussed hereFor iterative approach, idea is similar to Method 2 o 8 min read Check whether a binary tree is a full binary tree or not | Iterative Approach Given a binary tree containing n nodes. The problem is to check whether the given binary tree is a full binary tree or not. A full binary tree is defined as a binary tree in which all nodes have either zero or two child nodes. Conversely, there is no node in a full binary tree, which has only one child node. Examples: Input : 1 / \ 2 3 / \ 4 5 Outp 8 min read Deepest right leaf node in a binary tree | Iterative approach Given a Binary Tree, find the deepest leaf node that is the right child of its parent. For example, consider the following tree. The deepest right leaf node is the node with the value 10. Examples: Input : 1 / \ 2 3 \ / \ 4 5 6 \ \ 7 8 / \ 9 10 Output : 10 The idea is similar to Method 2 of level order traversal Traverse the tree level by level and 7 min read Recursive approach for alternating split of Linked List Given a linked list, split the linked list into two with alternate nodes. Examples: Input : 1 2 3 4 5 6 7 Output : 1 3 5 7 2 4 6 Input : 1 4 5 6 Output : 1 5 4 6 We have discussed Iterative splitting of linked list. The idea is to begin from two nodes first and second. Let us call these nodes as 'a' and 'b'. We recurs Implementation: C/C++ Code // 7 min read Largest value in each level of Binary Tree | Set-2 (Iterative Approach) Given a binary tree containing n nodes. The problem is to find and print the largest value present in each level. Examples: Input : 1 / \ 2 3 Output : 1 3 Input : 4 / \ 9 2 / \ \ 3 5 7 Output : 4 9 7 Approach: In the previous post, a recursive method have been discussed. In this post an iterative method has been discussed. The idea is to perform it 9 min read Iterative approach for removing middle points in a linked list of line segments This post explains the iterative approach of this problem. We maintain two pointers, prev and temp. If these two have either x or y same, we move forward till the equality holds and keep deleting the nodes in between. The node from which the equality started, we adjust the next pointer of that node. Implementation: C/C++ Code // C++ program to remo 9 min read Fibbinary Numbers (No consecutive 1s in binary) - O(1) Approach Given a positive integer n. The problem is to check if the number is Fibbinary Number or not. Fibbinary numbers are integers whose binary representation contains no consecutive ones.Examples : Input : 10 Output : Yes Explanation: 1010 is the binary representation of 10 which does not contains any consecutive 1's. Input : 11 Output : No Explanation: 4 min read Check if a given number is Pronic | Efficient Approach A pronic number is such a number which can be represented as a product of two consecutive positive integers. By multiplying these two consecutive positive integers, there can be formed a rectangle which is represented by the product or pronic number. So it is also known as Rectangular Number.The first few Pronic numbers are: 0, 2, 6, 12, 20, 30, 42 5 min read Level order traversal with direction change after every two levels | Recursive Approach Given a binary tree, print the level order traversal in such a way that first two levels are printed from left to right, next two levels are printed from right to left, then next two from left to right and so on. So, the problem is to reverse the direction of level order traversal of the binary tree after every two levels. Examples: Input: 1 / \ 2 10 min read

Article Tags :

Algorithms
DSA

Practice Tags :

Algorithms

Trending in News

How to Merge Cells in Google Sheets: Step by Step Guide
How to Lock Cells in Google Sheets : Step by Step Guide
#geekstreak2024 – 21 Days POTD Challenge Powered By Deutsche Bank

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy

'); $('.spinner-loading-overlay').show(); jQuery.ajax({ url: writeApiUrl + 'create-improvement-post/?v=1', type: "POST", contentType: 'application/json; charset=utf-8', dataType: 'json', xhrFields: { withCredentials: true }, data: JSON.stringify({ gfg_id: post_id, }), success:function(result) { $('.spinner-loading-overlay:eq(0)').remove(); $('.improve-modal--overlay').hide(); $('.unlocked-status--improve-modal-content').css("display","none"); $('.create-improvement-redirection-to-write').attr('href',writeUrl + 'improve-post/' + `${result.id}` + '/', '_blank'); $('.create-improvement-redirection-to-write')[0].click(); }, error:function(e) { $('.spinner-loading-overlay:eq(0)').remove(); var result = e.responseJSON; if(result.detail.non_field_errors.length){ $('.improve-modal--improve-content .improve-modal--improve-content-modified').text(`${result.detail.non_field_errors}.`); jQuery('.improve-modal--overlay').show(); jQuery('.improve-modal--improvement').show(); $('.locked-status--impove-modal').css("display","block"); $('.unlocked-status--improve-modal-content').css("display","none"); $('.improve-modal--improvement').attr("status","locked"); $('.improvement-reason-modal').hide(); } }, }); return; } var improvement_reason_html = ""; for(var comment of commentArray) { // loop creating improvement reason list markup var comment_id = comment['id']; var comment_text = comment['suggestion']; improvement_reason_html += `

${comment_text}

`; } $('.improvement-reasons_wrapper').html(improvement_reason_html); $('.improvement-bottom-btn').html("Create Improvement"); $('.improve-modal--improvement').hide(); $('.improvement-reason-modal').show(); }, error: function(e){ $('.spinner-loading-overlay:eq(0)').remove(); // stop loader when ajax failed; }, }); }, error:function(e) { $('.spinner-loading-overlay:eq(0)').remove(); var result = e.responseJSON; if(result.detail.non_field_errors.length){ $('.improve-modal--improve-content .improve-modal--improve-content-modified').text(`${result.detail.non_field_errors}.`); jQuery('.improve-modal--overlay').show(); jQuery('.improve-modal--improvement').show(); $('.locked-status--impove-modal').css("display","block"); $('.unlocked-status--improve-modal-content').css("display","none"); $('.improve-modal--improvement').attr("status","locked"); $('.improvement-reason-modal').hide(); } }, }); } else { if(loginData && !loginData.isLoggedIn) { $('.improve-modal--overlay').hide(); if ($('.header-main__wrapper').find('.header-main__signup.login-modal-btn').length) { $('.header-main__wrapper').find('.header-main__signup.login-modal-btn').click(); } return; } } }); $('.left-arrow-icon_wrapper').on('click',function(){ if($('.improve-modal--suggestion').is(":visible")) $('.improve-modal--suggestion').hide(); else{ $('.improvement-reason-modal').hide(); } $('.improve-modal--improvement').show(); }); function loadScript(src, callback) { var script = document.createElement('script'); script.src = src; script.onload = callback; document.head.appendChild(script); } function suggestionCall() { var suggest_val = $.trim($("#suggestion-section-textarea").val()); var array_String= suggest_val.split(" ") var gCaptchaToken = $("#g-recaptcha-response-suggestion-form").val(); var error_msg = false; if(suggest_val != "" && array_String.length >=4){ if(suggest_val.length <= 2000){ var payload = { "gfg_post_id" : `${post_id}`, "suggestion" : `

${suggest_val}

`, } if(!loginData || !loginData.isLoggedIn) // User is not logged in payload["g-recaptcha-token"] = gCaptchaToken jQuery.ajax({ type:'post', url: "https://apiwrite.geeksforgeeks.org/suggestions/auth/create/", xhrFields: { withCredentials: true }, crossDomain: true, contentType:'application/json', data: JSON.stringify(payload), success:function(data) { jQuery('.spinner-loading-overlay:eq(0)').remove(); jQuery('#suggestion-section-textarea').val(""); jQuery('.suggest-bottom-btn').css("display","none"); // Update the modal content const modalSection = document.querySelector('.suggestion-modal-section'); modalSection.innerHTML = `

Thank You!

Your suggestions are valuable to us.

You can now also contribute to the GeeksforGeeks community by creating improvement and help your fellow geeks.

`; }, error:function(data) { jQuery('.spinner-loading-overlay:eq(0)').remove(); jQuery('#suggestion-modal-alert').html("Something went wrong."); jQuery('#suggestion-modal-alert').show(); error_msg = true; } }); } else{ jQuery('.spinner-loading-overlay:eq(0)').remove(); jQuery('#suggestion-modal-alert').html("Minimum 5 Words and Maximum Character limit is 2000."); jQuery('#suggestion-modal-alert').show(); jQuery('#suggestion-section-textarea').focus(); error_msg = true; } } else{ jQuery('.spinner-loading-overlay:eq(0)').remove(); jQuery('#suggestion-modal-alert').html("Enter atleast four words !"); jQuery('#suggestion-modal-alert').show(); jQuery('#suggestion-section-textarea').focus(); error_msg = true; } if(error_msg){ setTimeout(() => { jQuery('#suggestion-section-textarea').focus(); jQuery('#suggestion-modal-alert').hide(); }, 3000); } } document.querySelector('.suggest-bottom-btn').addEventListener('click', function(){ jQuery('body').append('

'); jQuery('.spinner-loading-overlay').show(); if(loginData && loginData.isLoggedIn) { suggestionCall(); return; } // load the captcha script and set the token loadScript('https://www.google.com/recaptcha/api.js?render=6LdMFNUZAAAAAIuRtzg0piOT-qXCbDF-iQiUi9KY',[], function() { setGoogleRecaptcha(); }); }); $('.improvement-bottom-btn.create-improvement-btn').click(function() { //create improvement button is clicked $('body').append('

'); $('.spinner-loading-overlay').show(); // send this option via create-improvement-post api jQuery.ajax({ url: writeApiUrl + 'create-improvement-post/?v=1', type: "POST", contentType: 'application/json; charset=utf-8', dataType: 'json', xhrFields: { withCredentials: true }, data: JSON.stringify({ gfg_id: post_id }), success:function(result) { $('.spinner-loading-overlay:eq(0)').remove(); $('.improve-modal--overlay').hide(); $('.improvement-reason-modal').hide(); $('.create-improvement-redirection-to-write').attr('href',writeUrl + 'improve-post/' + `${result.id}` + '/', '_blank'); $('.create-improvement-redirection-to-write')[0].click(); }, error:function(e) { $('.spinner-loading-overlay:eq(0)').remove(); var result = e.responseJSON; if(result.detail.non_field_errors.length){ $('.improve-modal--improve-content .improve-modal--improve-content-modified').text(`${result.detail.non_field_errors}.`); jQuery('.improve-modal--overlay').show(); jQuery('.improve-modal--improvement').show(); $('.locked-status--impove-modal').css("display","block"); $('.unlocked-status--improve-modal-content').css("display","none"); $('.improve-modal--improvement').attr("status","locked"); $('.improvement-reason-modal').hide(); } }, }); });

Brute Force Approach and its pros and cons - GeeksforGeeks (2024)