Show all output

1 Stack s; 3 bool bSearch (int data[),int nItems, int key) 4 int low-o,mid,high-nItems-1; while (low data[mid]) low mid + 1; else 12 13 14 15 high mid; 16 if (key data[low]) 17 return true; 18 else 19 return false; 20 22 int main(void) t 23 int num,data[]13,5,10,15,16,19,23,37); 24 25 if (bSearch (data,8,19)) 26 cout