Finding a Balance with Efficiency
This week’ we covered Brute Force and Divide-and-Conquer. Brute-force methods try every possibility to find a solution. On the other hand, Divide-and-Conquer breaks a problem into smaller subproblems, solves each independently, and combines the results. This strategy is more efficient.
Homework 2 pushed me to implement programs to reinforce these
concepts. The first part asked for finding the closest distance between two
input numbers. The second part required sorting a set of unique positive
integers and displaying consecutive numbers in a compressed range format. Both demanded
attention to detail for the handling of input and algorithm correctness.
In summary, it's important to understand efficiency. Brute-force
approaches guarantee correctness. However, they are not practical for large inputs.
Divide-and-conquer provides more of a balance with its simplicity and efficiency.
Comments
Post a Comment