Update Pair sum sorted

Author: marttp

kotlin/src/main/kotlin/common/twopointers/pairsumsorted/PairSumSorted.kt

@@ -7,10 +7,15 @@ class PairSumSorted {
         var right = nums.size - 1
         while (left < right) {
             val sum = nums[left] + nums[right]
+            // If the sum is smaller, increment the left pointer, aiming
+            // to increase the sum toward the target value.
             if (sum < target) {
                 left++
+            // If the sum is larger, decrement the right pointer, aiming
+            // to decrease the sum toward the target value.
             } else if (sum > target) {
                 right--
+            // If the target pair is found, return its indexes.
             } else {
                 return listOf(left, right)
             }

kotlin/src/main/kotlin/common/twopointers/pairsumsorted/PairSumSortedBruteForce.kt

@@ -3,7 +3,8 @@ package common.twopointers.pairsumsorted
 class PairSumSortedBruteForce {
 
     fun solution(nums: IntArray, target: Int): List<Int> {
-        for (i in nums.indices) {
+        val n = nums.size
+        for (i in 0 until n) {
             for (j in i + 1 until nums.size) {
                 if (nums[i] + nums[j] == target) {
                     return listOf(i, j)