Minimum Replacements to Sort the Array

Explore the use of greedy techniques to solve optimization problems by finding the minimum number of replacements needed to sort an integer array. Understand the problem constraints and implement solutions efficiently to achieve a non-decreasing order.