Need help with writing an algorithm/pseudo code for this problem.
A mailman needs to start at the office A and visit all locations B, C and D and then back to A. How do I write an algorithm/pseudo code using the brute force method to find the best route.