Hill climbing algorithm

sphere function is tested

Hill climbing is a local search algorithm that iteratively improves a candidate solution by making small modifications and selecting the modification that leads to the highest increase in an objective function. It continues this process until it reaches a peak where no further improvements can be made with the current modifications.