Write the binary finder again

Look at the previous written procedures, I think it should be written again.

#include <stdio.h> #include <string.h>char* find (char *left, char *right,int len) {char K;char *mid= left + len/ 2;printf ("k="); scanf ("%c", &k), while (*mid! = *left) && (*mid!=*right)) {len/= 2;if (k = = *mid) return Mid;el Se if (k < *mid) {right = Mid;mid = left + len/2;} Else{left = Mid;mid = left + len/2;}} return NULL;} int main () {char arr[] = "123456"; int len = 0;len = strlen (arr);p rintf ("%d", find (arr, arr + len-1, Len)); System ("Pause") ; return 0;}

Write the binary finder again