Week 3 Discussion Forum

Basics Brute Force Algorithms

Basics Brute Force Algorithms

by Abdulla Al Moin 192-15-2838 -
Number of replies: 4

Brute Force Algorithms are exactly what they sound like – straightforward methods of solving a problem that rely on sheer computing power and trying every possibility rather than advanced techniques to improve efficiency.

In computer science, brute-force search or exhaustive search, also known as generate and test, is a very general problem-solving technique and algorithmic paradigm that consists of systematically enumerating all possible candidates for the solution and checking whether each candidate satisfies the problem's statement.


75 words

In reply to Abdulla Al Moin 192-15-2838

Re: Basics Brute Force Algorithms

by MD.ANISUR RAHMAN (192-15-2825) -
Brute Force Algorithms are exactly what they sound like – straightforward methods of solving a problem that rely on sheer computing power and trying every possibility rather than advanced techniques to improve efficiency.

Insertion sort has worst-case performance of O (n^2), best-case performance of O(n), and average case of O(n^2).

It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort

72 words

In reply to Abdulla Al Moin 192-15-2838

Re: Basics Brute Force Algorithms

by MD. IFTEKHARUL ISLAM RIDOY -
The "Brute-Force" algorithm is actually the most straight forward approach to solving a problem. This technique usually involves direct computation based on the problem's statement and the definition of the concepts involved.
The brute-force strategy is easiest to apply. 
Results in it's algorithm that can be improved with a modest amount of time as well as brute force is important due to it's wide applicability and simplicity.

67 words

In reply to Abdulla Al Moin 192-15-2838

Re: Basics Brute Force Algorithms

by Ahsan Habib Nobel -
Okay, the concept is clear. Still, I've a few questions.
The algorithms itself defining the purpose.
there are varieties of this Algorithms method. For a worst-case scenario, how I can determine which particular algorithm I've to apply to solve it in a corresponding way?

44 words

In reply to Ahsan Habib Nobel

Re: Basics Brute Force Algorithms

by Abdulla Al Moin 192-15-2838 -
Algorithms are most commonly judged by their efficiency and the amount of computing resources they require to complete their task.
A common way to evaluate an algorithm is to look at its time complexity. This shows how the running time of the algorithm grows as the input size grows. So, you have to calculate time complexity first. Then determine which particular algorithm strategy you may apply.
Secondly you have to understand how an algorithm operate on large data inputs. So in worst-case scenario, you just find out the time complexity of the strategies.

93 words