Question

The aim of this exercise is to check the presence of a number in an array.

Specifications:

• The items are integers arranged in ascending order.

• The array can contain up to 1 million items.

• The array is never NULL.

Implement the method bool Answer::exists(int ints[], int size, int k) so that it returns true if k belongs to ints, otherwise the method should return false. size contains the size of ints.

Important note: Try to save CPU cycles if possible.

Example:

int ints[] = {-9, 14, 37, 102);

Answer::exists(ints, 4, 102) returns true

Answer::exists(ints, 4, 36) returns false

Answer 1

Code in C++,

since array's element in ascending order then I can easily use binary search

bool exists(int ints[],int size,int k){

return binary_search(ints+0,ints+size,k)

}

binary_search() return true if k exists in array else false

if you want in any other language please let me know