Two Pointer Techniques

Title or Name of the Algorithm

• Two pointer algorithms

Describe the algorithm The two-pointer technique is a useful tool to utilize when searching for pairs in a sorted array. Although not it’s only use case, when used this technique can save both time and space complexity.

When iterating through data this usually implies a single starting point and movement through the data in one direction. However, as the two-pointer technique implies, there are two points of consideration and they both (usually) move towards the middle of the data being iterated over.