Two Pointers Technique Visualizer - Array Optimization

Two Pointers (Pair Sum): how it works

The Two Pointers technique is typically used for searching pairs in a sorted array. It is far more efficient than evaluating every possible pair.

1. Initialize Pointers

   Place one pointer at the extreme left (start) and another at the extreme right (end) of the sorted array.

2. Calculate Sum

   Add the elements at the two pointers.

3. Evaluate

   If the sum matches the target, the pair is found. If sum is less, move L right. If greater, move R left.

Complexity

Best-case time

O(1)

Average time

O(N)

Worst-case time

O(N)

Space

O(1)

This technique dramatically reduces time complexity from O(N²) to O(N) for pair sum problems, provided the array is sorted.