Write some Software small

Binary Search Algorithm Int search(int array[ ], int target) { Int start = 0; Int end = (sizeof(array)/sizeof(int) – 1; Int position = -1; While(start < end && position == -1 ) { Int middle = (start + end) / 2; If (target < array(middle)){ End = middle – 1; } Else if (target > array(middle)){ Start = middle + 1; } Else{ Position = middle; } } Return position; } Sequential Search algorithm Int search(int array[ ], int target) { Int position = -1; Int I; Int k = sizeof(array)/sizeof(int); For (I = 0; I < k && position == -1; i++) { If(array[i] == target) { Position = I; } Return position; } Working on bottom part