Can someone explain this, I was at another website explaining this. But one of the libarires they used was for a different IDE and I am not allowed to use that type of IDE so, I became lost when reading it.

Problem 3: Given an array A, and a number x, check for pair in A with sum as . Algorithm hasArrayTwoCandidates (A[], ar size, sum) 1) Sort the array in non-decreasing order. 2) Initialize two index variables to find the candidate elements in the sorted array t to the leftmost index: (a) Initialize firs - (b) Initialize second the rightmost index: r-ar_size-1 3) Loop while