Divide and Concurer, recursively divide the input array into smaller subarrays
First-In-First-Out (FIFO) data structure for sequential processing.
Technique using two pointers to solve array-based problems efficiently.
