find minimum in rotated sorted array

Author: eunhwa99

find-minimum-in-rotated-sorted-array/eunhwa99.java

@@ -1,17 +1,21 @@
 class Solution {
-  // TC: O(log N)
-  // SC: O(1)
+  // 시간 복잡도: O(log N) - Binary search
+  // 공간 복잡도: O(1) - Constant extra space
   public int findMin(int[] nums) {
-    int left = 0;
-    int right = nums.length - 1;
-    while (left < right) {
-      int mid = left + (right - left) / 2;
-      if (nums[mid] < nums[right]) {
-        right = mid;
+    int low = 0;
+    int high = nums.length - 1;
+
+    while (low < high) {
+      int mid = low + (high - low) / 2;
+
+      if (nums[mid] < nums[high]) {
+        high = mid;
       } else {
-        left = mid + 1;
+        low = mid + 1;
       }
     }
-    return nums[left];
+
+    return nums[low];
   }
 }
+