NEED TO ANSWER DISCUSSION QUESTIONS…

 Watch the live lecture BEFORE posting. You may also try this link.  http://www.personal.kent.edu/~bosikiew/Math11008/brute_nearest.pdf 

Question 1

Algorithms can be described as either efficient or inefficient. In your opinion, what does it mean when an algorithm is efficient versus when it is inefficient? Choose an example of each and explain why you think each one has mathematical merit (if any). Be sure to back your claims with any relevant research.

  • Post should contain at least 300 words discussing the difference between efficient vs inefficient algorithms. Make sure you are relating these processes to the Brute Force and Nearest Neighbor algorithm (and how they might apply to your life).