top of page

/////////////////////////////////////////////////////////////////////////////////////////////////////////////

WHAT IS BRUTE FORCE?

Brute force is useful when creating complex algorithms at once is hard.

It is the simplest algorithm. Bad words, it is ignorant way. 

So, it requires a lot of work than the other algorithms.

However, it is important because its applicability and simplicity.

This algorithm can be achieved by thoroughly enumerating all possibility to solve the problem.

It just dose check ALL CASE until finding solution.

Example 

{ 1 }

Selection Sort

It is an algorithm to sort looking for the smallest number.

  1. Start at the second index, and compare with first index.

  2. If the first number is bigger, then change first index. 

  3. Doing repeatly when final element is fixed.

Bubble Sort

{ 2 }

Bubble sort is an algorithm to sort the array

by comparing adjacent digits.

  1. Compare adjacent digits.

  2. If, I will exchange if the two numbers do not match the order.

  3. This I repeat to the end of the index is determined.

{ 0 }

Other algorithms

  • String Matching

  • Sequential Search

  • Traveling Salesman Problem

  • Knapsack Problem

  • Job Assignment problem

String Matching of brute force

GROUP PROJECT

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

Make the new Subway line with the least cost.

  1. Calculate the efficiency using all data

  2. Compare efficiency of all line

  3. Choose the best line.

SOLUTION

bottom of page