The fastest way to solve this
Computer Science
Level
3
Given an array \(S\) which is a sorted array of integers.
What is the fastest running time to find the maximum \(x-y\) where \(x, y \in S\)
by
Daniel Lim