Exhaustive SearchKasun Ranga Wijeweera(Email: krw19870829@gmail.com)
Motivation• Some problems involve searching through a vast number ofpotential solutions to find an answer• They do not see...
What is an Efficient Algorithm?• We have become conditioned to thinking that an algorithmmust be linear or run in time pro...
Travelling Salesman Problem• Given a set of N cities, find the shortest route connecting themall, with no city visited twi...
What is Exhaustive Search?• Also known as Brute Force Search or Generate and TestSearch• First enumerate all possible cand...
Reference
Any Questions?
Thank You!
Upcoming SlideShare
Loading in …5
×

Exhaustive Search

799 views

Published on

Published in: Technology
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
799
On SlideShare
0
From Embeds
0
Number of Embeds
5
Actions
Shares
0
Downloads
9
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Exhaustive Search

  1. 1. Exhaustive SearchKasun Ranga Wijeweera(Email: krw19870829@gmail.com)
  2. 2. Motivation• Some problems involve searching through a vast number ofpotential solutions to find an answer• They do not seem to be amendable to solution by efficientalgorithms
  3. 3. What is an Efficient Algorithm?• We have become conditioned to thinking that an algorithmmust be linear or run in time proportional to something like Nor N log N• We generally consider quadratic algorithms are bad and cubicalgorithms are awful• Even N50 algorithm would be pleasing because these problemsare believed to require exponential time
  4. 4. Travelling Salesman Problem• Given a set of N cities, find the shortest route connecting themall, with no city visited twice• It is still unthinkable to solve an arbitrary instance of theproblem for N = 1000• There seems to be no way to avoid having to check the lengthof a very large number of possible tours• Checking each and every tour is exhaustive search
  5. 5. What is Exhaustive Search?• Also known as Brute Force Search or Generate and TestSearch• First enumerate all possible candidates for the solution• Then check whether each candidate satisfies the problem’sstatement
  6. 6. Reference
  7. 7. Any Questions?
  8. 8. Thank You!

×