Find the running time of the following algorithms, can I have an step by step explanation please,

b) bool binary search (int* a, int start, int end, int number) f if(start > end) { return false; int middle - (starttend) /2; if (a [middle] number) return true; if(a [middle] number) return binary search (a, middle 1, end, number); return hinatv searsh (a, start, middle - 1, number)