Search in Rotated Sorted Array in DSA Javascript - Deep Dive

Overview - Search in Rotated Sorted Array

What is it?

A rotated sorted array is a sorted list that has been shifted or rotated at some unknown point. Searching in such an array means finding a target value efficiently despite this rotation. The goal is to locate the target's position or determine it is not present. This requires a special approach because the usual sorted search methods don't directly apply.

Why it matters

Without a method to search rotated sorted arrays efficiently, we would have to scan every element one by one, which is slow for large data. Many real-world problems involve data that is sorted but rotated, like circular buffers or shifted logs. Efficient search saves time and computing resources, making programs faster and more responsive.

Where it fits

Before this, learners should understand basic binary search on sorted arrays. After mastering this, they can explore more complex search problems like searching in rotated arrays with duplicates or searching in 2D rotated matrices.

Mental Model

Core Idea

Even though the array is rotated, one half of it remains sorted, and we can use this property to decide where to search next.

Think of it like...

Imagine a clock face where numbers are arranged in order but the clock is rotated so 12 is not at the top. If you want to find a number, you can still tell which half of the clock face to look at by checking if the numbers increase in order in that half.

Array: [4,5,6,7,0,1,2]
Indices:  0 1 2 3 4 5 6

Divide and check:
 ┌───────────────┐
 │4 5 6 7 | 0 1 2│
 └───────────────┘
Left half sorted? Yes (4 to 7)
Target 0 in left half? No
Search right half next.

Build-Up - 6 Steps

1

Foundation

Understand Rotated Sorted Array

Concept: Learn what a rotated sorted array looks like and how it differs from a normal sorted array.

A sorted array is like [0,1,2,4,5,6,7]. If we rotate it at index 3, it becomes [4,5,6,7,0,1,2]. The array is still made of two sorted parts but shifted. This rotation breaks the usual order but keeps partial order.

Result

You can see the array is not fully sorted but has two sorted segments.

Understanding the structure of rotated arrays is key to knowing why normal binary search fails and why a modified approach is needed.

2

Foundation

Review Basic Binary Search

Concept: Recall how binary search works on a fully sorted array by repeatedly dividing the search space.

Binary search picks the middle element and compares it to the target. If equal, done. If target is smaller, search left half; if larger, search right half. This halves the search space each time.

Result

Binary search finds the target in O(log n) time on sorted arrays.

Binary search's efficiency depends on the array being fully sorted, which is not true for rotated arrays.

3

Intermediate

Identify Sorted Half in Rotation

🤔Before reading on: do you think both halves of a rotated array are always sorted? Commit to yes or no.

Concept: In a rotated array, at least one half (left or right) is always sorted. This helps decide where to search next.

Check the middle element against the start element. If middle is greater or equal to start, left half is sorted. Otherwise, right half is sorted. This is because rotation splits the array into two sorted parts.

Result

You can always tell which half is sorted by comparing start and middle elements.

Knowing one half is sorted lets you decide if the target lies there or in the other half, guiding the search direction.

4

Intermediate

Decide Search Direction Using Target

🤔Before reading on: if left half is sorted, do you search it only if target is within its range? Commit to yes or no.

Concept: Once the sorted half is identified, check if the target lies within its range to decide where to continue searching.

If left half is sorted and target is between start and middle elements, search left half. Otherwise, search right half. If right half is sorted, do the opposite check.

Result

The search space is halved each time, focusing on the half that could contain the target.

This conditional narrowing maintains binary search efficiency despite rotation.

5

Advanced

Implement Search Algorithm in JavaScript

🤔Before reading on: do you think the algorithm needs to check both halves every time? Commit to yes or no.

Concept: Write code that uses the above logic to find the target index or return -1 if not found.

function searchRotatedArray(nums, target) { let left = 0, right = nums.length - 1; while (left <= right) { const mid = Math.floor((left + right) / 2); if (nums[mid] === target) return mid; if (nums[left] <= nums[mid]) { // Left half sorted if (nums[left] <= target && target < nums[mid]) { right = mid - 1; } else { left = mid + 1; } } else { // Right half sorted if (nums[mid] < target && target <= nums[right]) { left = mid + 1; } else { right = mid - 1; } } } return -1; } // Example: // searchRotatedArray([4,5,6,7,0,1,2], 0) returns 4

Result

The function returns the index of the target if found, or -1 if not.

Implementing the logic in code solidifies understanding and shows how the theory applies practically.

6

Expert

Handle Edge Cases and Performance

🤔Before reading on: do you think duplicates affect the search logic? Commit to yes or no.

Concept: Explore how duplicates or empty arrays affect the algorithm and how to adapt it.

Duplicates can break the strict sorted half check because nums[left] == nums[mid] might be true even if halves are not strictly sorted. To handle this, increment left pointer when duplicates are detected. Also, empty arrays return -1 immediately. Performance remains O(log n) in most cases but can degrade to O(n) with many duplicates.

Result

Algorithm works correctly even with duplicates, though worst-case time can increase.

Understanding edge cases prevents bugs and prepares for real-world data which often contains duplicates.

Under the Hood

The algorithm uses a modified binary search that exploits the property that in a rotated sorted array, one half is always sorted. By comparing the middle element with the start and end elements, it identifies the sorted half. Then it checks if the target lies within that half's range to decide which half to discard. This halves the search space each iteration, maintaining logarithmic time complexity.

Why designed this way?

The design leverages the partial order preserved by rotation to avoid linear search. Alternatives like linear scan are too slow. The approach balances simplicity and efficiency, handling rotation without fully restoring order. It was chosen because it extends binary search principles to a more complex scenario.

Start
  │
  ▼
[Left]───[Mid]───[Right]
   │        │        │
   ├─Check if left half sorted (nums[left] <= nums[mid])
   │        │
   │    Yes ──> Is target in [nums[left], nums[mid])?
   │        │        │
   │        │    Yes ──> Search left half (right = mid - 1)
   │        │    No  ──> Search right half (left = mid + 1)
   │
   No
   │
   └─Right half sorted
            │
      Is target in (nums[mid], nums[right]]?
            │        │
          Yes ──> Search right half (left = mid + 1)
          No  ──> Search left half (right = mid - 1)

Myth Busters - 3 Common Misconceptions

Quick: Does the entire rotated array remain fully sorted? Commit yes or no.

Common Belief: The rotated array is still fully sorted, just shifted.

Reality: The rotated array is not fully sorted; it consists of two sorted parts separated by the rotation point.

Why it matters: Assuming full sorting leads to applying normal binary search, which can give wrong results or miss the target.

Quick: Can you always pick either half to search next without checking? Commit yes or no.

Common Belief: You can pick any half to search next because the array is mostly sorted.

Reality: You must identify which half is sorted and whether the target lies there; otherwise, you may discard the half containing the target.

Why it matters: Ignoring this leads to incorrect search paths and failure to find the target.

Quick: Do duplicates not affect the search logic? Commit yes or no.

Common Belief: Duplicates do not affect the search algorithm since it only compares values.

Reality: Duplicates can break the sorted half detection, requiring special handling to avoid infinite loops or wrong decisions.

Why it matters: Not handling duplicates can cause the algorithm to fail or degrade to linear search.

Expert Zone

1

When duplicates exist, the algorithm may degrade from O(log n) to O(n) because it cannot reliably identify the sorted half.

2

Choosing to increment the left pointer when duplicates are detected is a subtle but effective way to maintain progress.

3

The algorithm assumes no integer overflow in midpoint calculation; using mid = left + Math.floor((right - left) / 2) avoids this.

When NOT to use

Do not use this approach if the array contains many duplicates and performance is critical; instead, consider linear search or specialized algorithms. Also, if the array is not rotated or is fully sorted, normal binary search is simpler and faster.

Production Patterns

This search pattern is used in systems handling circular buffers, rotated logs, or time-series data with shifts. It is also a common interview problem to test understanding of binary search adaptations.

Connections

Binary Search

Builds-on

Understanding binary search is essential because searching in rotated arrays is a modified form of it, adapting to partial order.

Circular Buffers

Application

Rotated sorted arrays model circular buffers where data wraps around; searching efficiently in such buffers uses similar logic.

Signal Processing - Phase Shift

Analogy in different field

Just like a rotated array is a shifted sequence, phase shift in signals represents rotation in time domain; understanding one helps grasp the concept of shifted data in the other.

Common Pitfalls

#1 Assuming the entire array is sorted and applying normal binary search.

Wrong approach:

function search(nums, target) {
let left = 0, right = nums.length - 1;
while (left <= right) {
const mid = Math.floor((left + right) / 2);
if (nums[mid] === target) return mid;
if (target < nums[mid]) right = mid - 1;
else left = mid + 1;
}
return -1;
}

Correct approach:

function searchRotatedArray(nums, target) {
let left = 0, right = nums.length - 1;
while (left <= right) {
const mid = Math.floor((left + right) / 2);
if (nums[mid] === target) return mid;
if (nums[left] <= nums[mid]) {
if (nums[left] <= target && target < nums[mid]) right = mid - 1;
else left = mid + 1;
} else {
if (nums[mid] < target && target <= nums[right]) left = mid + 1;
else right = mid - 1;
}
}
return -1;
}

Root cause:

Misunderstanding that rotation breaks full sorting, so normal binary search logic fails.

#2 Not handling duplicates causing infinite loops or wrong decisions.

Wrong approach:

function search(nums, target) {
let left = 0, right = nums.length - 1;
while (left <= right) {
const mid = Math.floor((left + right) / 2);
if (nums[mid] === target) return mid;
if (nums[left] <= nums[mid]) {
if (nums[left] <= target && target < nums[mid]) right = mid - 1;
else left = mid + 1;
} else {
if (nums[mid] < target && target <= nums[right]) left = mid + 1;
else right = mid - 1;
}
}
return -1;
}

Correct approach:

function search(nums, target) {
let left = 0, right = nums.length - 1;
while (left <= right) {
const mid = Math.floor((left + right) / 2);
if (nums[mid] === target) return mid;
if (nums[left] === nums[mid] && nums[mid] === nums[right]) {
left++;
right--;
} else if (nums[left] <= nums[mid]) {
if (nums[left] <= target && target < nums[mid]) right = mid - 1;
else left = mid + 1;
} else {
if (nums[mid] < target && target <= nums[right]) left = mid + 1;
else right = mid - 1;
}
}
return -1;
}

Root cause:

Ignoring the effect of duplicates on sorted half detection and failing to adjust pointers.

Key Takeaways

A rotated sorted array is partially sorted, split into two sorted halves by rotation.

Binary search can be adapted to rotated arrays by identifying which half is sorted and checking if the target lies there.

This approach maintains O(log n) efficiency by discarding half the search space each step.

Duplicates complicate the logic and may degrade performance, requiring special handling.

Understanding this algorithm prepares you for real-world problems involving shifted or circular data.

Practice

1. What is the main challenge when searching in a rotated sorted array compared to a normal sorted array?

easy

A. The array contains only negative numbers

B. The array elements are all the same

C. The array is sorted in descending order

D. The array is split into two sorted parts, so normal binary search needs adjustment

Solution

1. Step 1: Understand the array structure

   A rotated sorted array is created by taking a sorted array and rotating it at some pivot, splitting it into two sorted parts.

2. Step 2: Reason about search difficulty

   Normal binary search assumes the whole array is sorted, but here the array is split, so we must adjust the search to handle two sorted parts.

3. Final Answer:

   The array is split into two sorted parts, so normal binary search needs adjustment -> Option D

4. Quick Check:

   Rotated array = split sorted parts [OK]

Hint: Look for the pivot splitting the array into two sorted halves [OK]

Common Mistakes:

• Assuming the entire array is sorted
• Ignoring the pivot point
• Using linear search instead of binary search

2. Which of the following is the correct syntax to start a binary search in a rotated sorted array in JavaScript?

easy

A. let left = 0, right = arr.length - 1;

B. let left = 1, right = arr.length;

C. let left = -1, right = arr.length;

D. let left = 0, right = arr.length;

Solution

1. Step 1: Identify valid index range for binary search

   Binary search uses zero-based indexing, so left starts at 0 and right at last index (length - 1).

2. Step 2: Check each option

   let left = 0, right = arr.length - 1; correctly sets left=0 and right=arr.length-1. Others have invalid ranges or off-by-one errors.

3. Final Answer:

   let left = 0, right = arr.length - 1; -> Option A

4. Quick Check:

   Index range = 0 to length-1 [OK]

Hint: Start binary search with left=0 and right=length-1 [OK]

Common Mistakes:

• Using right = arr.length (out of bounds)
• Starting left at 1 instead of 0
• Negative indices for left or right

3. What will be the output of the following code snippet?

const arr = [4,5,6,7,0,1,2];
function search(nums, target) {
  let left = 0, right = nums.length - 1;
  while (left <= right) {
    let mid = Math.floor((left + right) / 2);
    if (nums[mid] === target) return mid;
    if (nums[left] <= nums[mid]) {
      if (target >= nums[left] && target < nums[mid]) right = mid - 1;
      else left = mid + 1;
    } else {
      if (target > nums[mid] && target <= nums[right]) left = mid + 1;
      else right = mid - 1;
    }
  }
  return -1;
}
console.log(search(arr, 0));

medium

A. 6

B. 0

C. 4

D. -1

Solution

1. Step 1: Understand the array and target

   The array is rotated sorted: [4,5,6,7,0,1,2], target is 0.

2. Step 2: Trace the binary search steps

   Initial left=0, right=6, mid=3 (value 7). Left half is sorted (4 to 7). Target 0 is not in left half, so search right half: left=4, right=6.
   New mid=5 (value 1). Left half (0 to 1) is sorted. Target 0 is in left half, so right=4.
   New mid=4 (value 0), found target at index 4.

3. Final Answer:

   4 -> Option C

4. Quick Check:

   Target 0 found at index 4 [OK]

Hint: Check which half is sorted, then decide search side [OK]

Common Mistakes:

• Not updating left/right correctly
• Confusing sorted half
• Returning wrong index or -1

4. Identify the bug in this search function for rotated sorted array:

function search(nums, target) {
  let left = 0, right = nums.length - 1;
  while (left < right) {
    let mid = Math.floor((left + right) / 2);
    if (nums[mid] === target) return mid;
    if (nums[left] <= nums[mid]) {
      if (target >= nums[left] && target < nums[mid]) right = mid - 1;
      else left = mid + 1;
    } else {
      if (target > nums[mid] && target <= nums[right]) left = mid + 1;
      else right = mid - 1;
    }
  }
  return -1;
}

medium

A. The loop condition should be left <= right, not left < right

B. The mid calculation is incorrect

C. The target comparison uses wrong operators

D. The function should return left instead of -1

Solution

1. Step 1: Analyze the loop condition

   The loop uses while(left < right), which misses checking when left equals right, possibly skipping the last element.

2. Step 2: Correct the loop condition

   Changing to while(left <= right) ensures all elements are checked, including when left == right.

3. Final Answer:

   The loop condition should be left <= right, not left < right -> Option A

4. Quick Check:

   Loop must cover all indices [OK]

Hint: Use while(left <= right) to cover all elements [OK]

Common Mistakes:

• Using while(left < right) misses last element
• Incorrect mid calculation (not here though)
• Returning wrong index when not found

5. Given a rotated sorted array with possible duplicates, which modification is needed in the binary search to correctly find the target?

const arr = [2,5,6,0,0,1,2];
function search(nums, target) {
  let left = 0, right = nums.length - 1;
  while (left <= right) {
    let mid = Math.floor((left + right) / 2);
    if (nums[mid] === target) return true;
    if (nums[left] === nums[mid] && nums[mid] === nums[right]) {
      left++;
      right--;
    } else if (nums[left] <= nums[mid]) {
      if (target >= nums[left] && target < nums[mid]) right = mid - 1;
      else left = mid + 1;
    } else {
      if (target > nums[mid] && target <= nums[right]) left = mid + 1;
      else right = mid - 1;
    }
  }
  return false;
}

hard

A. Remove the duplicate elements before searching

B. Add checks to skip duplicates when left, mid, right are equal

C. Use linear search instead of binary search

D. Ignore duplicates and proceed as normal

Solution

1. Step 1: Understand duplicates impact

   Duplicates can cause ambiguity in deciding which half is sorted, breaking normal binary search logic.

2. Step 2: Skip duplicates when left, mid, right are equal

   When nums[left] == nums[mid] == nums[right], increment left and decrement right to skip duplicates and reduce search space.

3. Final Answer:

   Add checks to skip duplicates when left, mid, right are equal -> Option B

4. Quick Check:

   Skip duplicates to maintain binary search correctness [OK]

Hint: Skip duplicates when left, mid, right values match [OK]

Common Mistakes:

• Ignoring duplicates causing infinite loops
• Trying to remove duplicates before search
• Switching to linear search unnecessarily