[SOLVED] SOLVED: iterativeBinarySearch

Description

Searches the array a for key. If key is not in the array segment, then -1 is returned. Otherwise returns an index in the segment such that key == a[index].Precondition: a[lowEnd] <= a[lowEnd + 1]<= … <= a[highEnd]