Understand the core difference between first-fit and best-fit decreasing algorithms by comparing their approaches to placing items into bins.

Analyze the time complexity of both algorithms and explain why best-fit decreasing often yields better results in practice despite similar worst-case complexities.

Prove or disprove the following statement: "For any given set of items, the best-fit decreasing algorithm will always produce a solution that uses fewer or equal bins compared to the first-fit decreasing algorithm."