Minimum Sub Array Size for a Target

Given a sorted array of positive integers, find the size of the smallest sub array that sums up to the given target or has a single number bigger than the target.

---

Example:

Input  : {1,2,3,4,5} 
Target Sum : 8
Output : 2