#define NULL ((void *)0)
typedef unsigned long size_t; // Customize by platform.
typedef long intptr_t;
typedef unsigned long uintptr_t;
typedef long scalar_t__; // Either arithmetic or pointer type.
/* By default, we understand bool (as a convenience). */
typedef int bool;
#define false 0
#define true 1

/* Forward declarations */

/* Type definitions */
typedef int /*<<< orphan*/ x;

/* Variables and functions */
int binary_search(int *, int, int);
int binary_search_recursive(int *, int /*<<< orphan*/, int, int);
int /*<<< orphan*/ printf(char *, ...);
int main(void) {
  int x[] = {0, 1, 2, 3, 4, 6, 7, 8, 9};
  printf("Finding index of item: %d\n", 6);
  int element_index = binary_search(x, sizeof(x) / sizeof(*x), 6);
  if (element_index >= 0) {
    printf("Found element index: %d\n", element_index);
  } else {
    printf("Element not found\n");
  }
  printf("Finding index of item: %d\n", 10);
  element_index = binary_search(x, sizeof(x) / sizeof(*x), 10);
  if (element_index >= 0) {
    printf("Found element index: %d\n", element_index);
  } else {
    printf("Element not found\n");
  }
  printf("Finding index of item: %d\n", 5);
  element_index = binary_search(x, sizeof(x) / sizeof(*x), 5);
  if (element_index >= 0) {
    printf("Found element index: %d\n", element_index);
  } else {
    printf("Element not found\n");
  }
  printf("Finding index of item (recursive): %d\n", 6);
  element_index = binary_search_recursive(x, 0, sizeof(x) / sizeof(*x) - 1, 6);
  if (element_index >= 0) {
    printf("Found element index: %d\n", element_index);
  } else {
    printf("Element not found\n");
  }
  printf("Finding index of item (recursive): %d\n", 10);
  element_index = binary_search_recursive(x, 0, sizeof(x) / sizeof(*x) - 1, 10);
  if (element_index >= 0) {
    printf("Found element index: %d\n", element_index);
  } else {
    printf("Element not found\n");
  }
  printf("Finding index of item (recursive): %d\n", -1);
  element_index = binary_search_recursive(x, 0, sizeof(x) / sizeof(*x) - 1, -1);
  if (element_index >= 0) {
    printf("Found element index: %d\n", element_index);
  } else {
    printf("Element not found\n");
  }
  printf("Finding index of item (recursive): %d\n", 5);
  element_index = binary_search_recursive(x, 0, sizeof(x) / sizeof(*x) - 1, 5);
  if (element_index >= 0) {
    printf("Found element index: %d\n", element_index);
  } else {
    printf("Element not found\n");
  }
  return 0;
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x40,%rsp
movl   $0x0,-0x4(%rbp)
lea    -0x30(%rbp),%rdi
lea    0xea6(%rip),%rsi
mov    $0x24,%edx
call   1040 <memcpy@plt>
lea    0xeb9(%rip),%rdi
mov    $0x6,%esi
mov    $0x0,%al
call   1030 <printf@plt>
lea    -0x30(%rbp),%rdi
mov    $0x9,%esi
mov    $0x6,%edx
call   1050 <binary_search@plt>
mov    %eax,-0x34(%rbp)
cmpl   $0x0,-0x34(%rbp)
jl     11ad <main+0x6d>
mov    -0x34(%rbp),%esi
lea    0xe9e(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
jmp    11bb <main+0x7b>
lea    0xea4(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0xe62(%rip),%rdi
mov    $0xa,%esi
mov    $0x0,%al
call   1030 <printf@plt>
lea    -0x30(%rbp),%rdi
mov    $0x9,%esi
mov    $0xa,%edx
call   1050 <binary_search@plt>
mov    %eax,-0x34(%rbp)
cmpl   $0x0,-0x34(%rbp)
jl     1204 <main+0xc4>
mov    -0x34(%rbp),%esi
lea    0xe47(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
jmp    1212 <main+0xd2>
lea    0xe4d(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0xe0b(%rip),%rdi
mov    $0x5,%esi
mov    $0x0,%al
call   1030 <printf@plt>
lea    -0x30(%rbp),%rdi
mov    $0x9,%esi
mov    $0x5,%edx
call   1050 <binary_search@plt>
mov    %eax,-0x34(%rbp)
cmpl   $0x0,-0x34(%rbp)
jl     125b <main+0x11b>
mov    -0x34(%rbp),%esi
lea    0xdf0(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
jmp    1269 <main+0x129>
lea    0xdf6(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0xdfb(%rip),%rdi
mov    $0x6,%esi
mov    $0x0,%al
call   1030 <printf@plt>
lea    -0x30(%rbp),%rdi
xor    %esi,%esi
mov    $0x8,%edx
mov    $0x6,%ecx
call   1060 <binary_search_recursive@plt>
mov    %eax,-0x34(%rbp)
cmpl   $0x0,-0x34(%rbp)
jl     12b4 <main+0x174>
mov    -0x34(%rbp),%esi
lea    0xd97(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
jmp    12c2 <main+0x182>
lea    0xd9d(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0xda2(%rip),%rdi
mov    $0xa,%esi
mov    $0x0,%al
call   1030 <printf@plt>
lea    -0x30(%rbp),%rdi
xor    %esi,%esi
mov    $0x8,%edx
mov    $0xa,%ecx
call   1060 <binary_search_recursive@plt>
mov    %eax,-0x34(%rbp)
cmpl   $0x0,-0x34(%rbp)
jl     130d <main+0x1cd>
mov    -0x34(%rbp),%esi
lea    0xd3e(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
jmp    131b <main+0x1db>
lea    0xd44(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0xd49(%rip),%rdi
mov    $0xffffffff,%esi
mov    $0x0,%al
call   1030 <printf@plt>
lea    -0x30(%rbp),%rdi
xor    %esi,%esi
mov    $0x8,%edx
mov    $0xffffffff,%ecx
call   1060 <binary_search_recursive@plt>
mov    %eax,-0x34(%rbp)
cmpl   $0x0,-0x34(%rbp)
jl     1366 <main+0x226>
mov    -0x34(%rbp),%esi
lea    0xce5(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
jmp    1374 <main+0x234>
lea    0xceb(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0xcf0(%rip),%rdi
mov    $0x5,%esi
mov    $0x0,%al
call   1030 <printf@plt>
lea    -0x30(%rbp),%rdi
xor    %esi,%esi
mov    $0x8,%edx
mov    $0x5,%ecx
call   1060 <binary_search_recursive@plt>
mov    %eax,-0x34(%rbp)
cmpl   $0x0,-0x34(%rbp)
jl     13bf <main+0x27f>
mov    -0x34(%rbp),%esi
lea    0xc8c(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
jmp    13cd <main+0x28d>
lea    0xc92(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
xor    %eax,%eax
add    $0x40,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
sub    $0x28,%rsp
mov    0xed6(%rip),%eax
mov    %eax,0x20(%rsp)
movaps 0xebb(%rip),%xmm0
movaps %xmm0,0x10(%rsp)
movaps 0xe9f(%rip),%xmm0
movaps %xmm0,(%rsp)
lea    0xeb8(%rip),%rdi
mov    $0x6,%esi
xor    %eax,%eax
call   1040 <printf@plt>
mov    %rsp,%rdi
mov    $0x9,%esi
mov    $0x6,%edx
call   1050 <binary_search@plt>
test   %eax,%eax
js     11a0 <main+0x60>
lea    0xeaa(%rip),%rdi
mov    %eax,%esi
xor    %eax,%eax
call   1040 <printf@plt>
jmp    11ac <main+0x6c>
lea    0xed8(%rip),%rdi
call   1030 <puts@plt>
lea    0xe71(%rip),%rdi
mov    $0xa,%esi
xor    %eax,%eax
call   1040 <printf@plt>
mov    %rsp,%rdi
mov    $0x9,%esi
mov    $0xa,%edx
call   1050 <binary_search@plt>
test   %eax,%eax
js     11e7 <main+0xa7>
lea    0xe63(%rip),%rdi
mov    %eax,%esi
xor    %eax,%eax
call   1040 <printf@plt>
jmp    11f3 <main+0xb3>
lea    0xe91(%rip),%rdi
call   1030 <puts@plt>
lea    0xe2a(%rip),%rdi
mov    $0x5,%esi
xor    %eax,%eax
call   1040 <printf@plt>
mov    %rsp,%rdi
mov    $0x9,%esi
mov    $0x5,%edx
call   1050 <binary_search@plt>
test   %eax,%eax
js     122e <main+0xee>
lea    0xe1c(%rip),%rdi
mov    %eax,%esi
xor    %eax,%eax
call   1040 <printf@plt>
jmp    123a <main+0xfa>
lea    0xe4a(%rip),%rdi
call   1030 <puts@plt>
lea    0xe17(%rip),%rdi
mov    $0x6,%esi
xor    %eax,%eax
call   1040 <printf@plt>
mov    %rsp,%rdi
xor    %esi,%esi
mov    $0x8,%edx
mov    $0x6,%ecx
call   1060 <binary_search_recursive@plt>
test   %eax,%eax
js     1277 <main+0x137>
lea    0xdd3(%rip),%rdi
mov    %eax,%esi
xor    %eax,%eax
call   1040 <printf@plt>
jmp    1283 <main+0x143>
lea    0xe01(%rip),%rdi
call   1030 <puts@plt>
lea    0xdce(%rip),%rdi
mov    $0xa,%esi
xor    %eax,%eax
call   1040 <printf@plt>
mov    %rsp,%rdi
xor    %esi,%esi
mov    $0x8,%edx
mov    $0xa,%ecx
call   1060 <binary_search_recursive@plt>
test   %eax,%eax
js     12c0 <main+0x180>
lea    0xd8a(%rip),%rdi
mov    %eax,%esi
xor    %eax,%eax
call   1040 <printf@plt>
jmp    12cc <main+0x18c>
lea    0xdb8(%rip),%rdi
call   1030 <puts@plt>
lea    0xd85(%rip),%rdi
mov    $0xffffffff,%esi
xor    %eax,%eax
call   1040 <printf@plt>
mov    %rsp,%rdi
xor    %esi,%esi
mov    $0x8,%edx
mov    $0xffffffff,%ecx
call   1060 <binary_search_recursive@plt>
test   %eax,%eax
js     1309 <main+0x1c9>
lea    0xd41(%rip),%rdi
mov    %eax,%esi
xor    %eax,%eax
call   1040 <printf@plt>
jmp    1315 <main+0x1d5>
lea    0xd6f(%rip),%rdi
call   1030 <puts@plt>
lea    0xd3c(%rip),%rdi
mov    $0x5,%esi
xor    %eax,%eax
call   1040 <printf@plt>
mov    %rsp,%rdi
xor    %esi,%esi
mov    $0x8,%edx
mov    $0x5,%ecx
call   1060 <binary_search_recursive@plt>
test   %eax,%eax
js     1352 <main+0x212>
lea    0xcf8(%rip),%rdi
mov    %eax,%esi
xor    %eax,%eax
call   1040 <printf@plt>
jmp    135e <main+0x21e>
lea    0xd26(%rip),%rdi
call   1030 <puts@plt>
xor    %eax,%eax
add    $0x28,%rsp
ret

LLVM IR (-O0):
@__const.main.x = [9 x i32] [i32 0, i32 1, i32 2, i32 3, i32 4, i32 6, i32 7, i32 8, i32 9]
@.str = [27 x i8] c"Finding index of item: %d\0A\00"
@.str.1 = [25 x i8] c"Found element index: %d\0A\00"
@.str.2 = [19 x i8] c"Element not found\0A\00"
@.str.3 = [39 x i8] c"Finding index of item (recursive): %d\0A\00"
define i32 @main() {
%1 = alloca i32
%2 = alloca [9 x i32]
%3 = alloca i32
store i32 0, i32* %1
%4 = bitcast [9 x i32]* %2 to i8*
%5 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([27 x i8], [27 x i8]* @.str, i64 0, i64 0), i32 6)
%6 = getelementptr inbounds [9 x i32], [9 x i32]* %2, i64 0, i64 0
%7 = call i32 @binary_search(i32* %6, i32 9, i32 6)
store i32 %7, i32* %3
%8 = load i32, i32* %3
%9 = icmp sge i32 %8, 0
br i1 %9, label %10, label %13
10: ; preds = %0
%11 = load i32, i32* %3
%12 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([25 x i8], [25 x i8]* @.str.1, i64 0, i64 0), i32 %11)
br label %15
13: ; preds = %0
%14 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str.2, i64 0, i64 0))
br label %15
15: ; preds = %13, %10
%16 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([27 x i8], [27 x i8]* @.str, i64 0, i64 0), i32 10)
%17 = getelementptr inbounds [9 x i32], [9 x i32]* %2, i64 0, i64 0
%18 = call i32 @binary_search(i32* %17, i32 9, i32 10)
store i32 %18, i32* %3
%19 = load i32, i32* %3
%20 = icmp sge i32 %19, 0
br i1 %20, label %21, label %24
21: ; preds = %15
%22 = load i32, i32* %3
%23 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([25 x i8], [25 x i8]* @.str.1, i64 0, i64 0), i32 %22)
br label %26
24: ; preds = %15
%25 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str.2, i64 0, i64 0))
br label %26
26: ; preds = %24, %21
%27 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([27 x i8], [27 x i8]* @.str, i64 0, i64 0), i32 5)
%28 = getelementptr inbounds [9 x i32], [9 x i32]* %2, i64 0, i64 0
%29 = call i32 @binary_search(i32* %28, i32 9, i32 5)
store i32 %29, i32* %3
%30 = load i32, i32* %3
%31 = icmp sge i32 %30, 0
br i1 %31, label %32, label %35
32: ; preds = %26
%33 = load i32, i32* %3
%34 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([25 x i8], [25 x i8]* @.str.1, i64 0, i64 0), i32 %33)
br label %37
35: ; preds = %26
%36 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str.2, i64 0, i64 0))
br label %37
37: ; preds = %35, %32
%38 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([39 x i8], [39 x i8]* @.str.3, i64 0, i64 0), i32 6)
%39 = getelementptr inbounds [9 x i32], [9 x i32]* %2, i64 0, i64 0
%40 = call i32 @binary_search_recursive(i32* %39, i32 0, i32 8, i32 6)
store i32 %40, i32* %3
%41 = load i32, i32* %3
%42 = icmp sge i32 %41, 0
br i1 %42, label %43, label %46
43: ; preds = %37
%44 = load i32, i32* %3
%45 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([25 x i8], [25 x i8]* @.str.1, i64 0, i64 0), i32 %44)
br label %48
46: ; preds = %37
%47 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str.2, i64 0, i64 0))
br label %48
48: ; preds = %46, %43
%49 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([39 x i8], [39 x i8]* @.str.3, i64 0, i64 0), i32 10)
%50 = getelementptr inbounds [9 x i32], [9 x i32]* %2, i64 0, i64 0
%51 = call i32 @binary_search_recursive(i32* %50, i32 0, i32 8, i32 10)
store i32 %51, i32* %3
%52 = load i32, i32* %3
%53 = icmp sge i32 %52, 0
br i1 %53, label %54, label %57
54: ; preds = %48
%55 = load i32, i32* %3
%56 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([25 x i8], [25 x i8]* @.str.1, i64 0, i64 0), i32 %55)
br label %59
57: ; preds = %48
%58 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str.2, i64 0, i64 0))
br label %59
59: ; preds = %57, %54
%60 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([39 x i8], [39 x i8]* @.str.3, i64 0, i64 0), i32 -1)
%61 = getelementptr inbounds [9 x i32], [9 x i32]* %2, i64 0, i64 0
%62 = call i32 @binary_search_recursive(i32* %61, i32 0, i32 8, i32 -1)
store i32 %62, i32* %3
%63 = load i32, i32* %3
%64 = icmp sge i32 %63, 0
br i1 %64, label %65, label %68
65: ; preds = %59
%66 = load i32, i32* %3
%67 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([25 x i8], [25 x i8]* @.str.1, i64 0, i64 0), i32 %66)
br label %70
68: ; preds = %59
%69 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str.2, i64 0, i64 0))
br label %70
70: ; preds = %68, %65
%71 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([39 x i8], [39 x i8]* @.str.3, i64 0, i64 0), i32 5)
%72 = getelementptr inbounds [9 x i32], [9 x i32]* %2, i64 0, i64 0
%73 = call i32 @binary_search_recursive(i32* %72, i32 0, i32 8, i32 5)
store i32 %73, i32* %3
%74 = load i32, i32* %3
%75 = icmp sge i32 %74, 0
br i1 %75, label %76, label %79
76: ; preds = %70
%77 = load i32, i32* %3
%78 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([25 x i8], [25 x i8]* @.str.1, i64 0, i64 0), i32 %77)
br label %81
79: ; preds = %70
%80 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str.2, i64 0, i64 0))
br label %81
81: ; preds = %79, %76
ret i32 0
}

LLVM IR (-O2):
@__const.main.x = [9 x i32] [i32 0, i32 1, i32 2, i32 3, i32 4, i32 6, i32 7, i32 8, i32 9]
@.str = [27 x i8] c"Finding index of item: %d\0A\00"
@.str.1 = [25 x i8] c"Found element index: %d\0A\00"
@.str.3 = [39 x i8] c"Finding index of item (recursive): %d\0A\00"
@str.9 = [18 x i8] c"Element not found\00"
define i32 @main() {
%1 = alloca [9 x i32]
%2 = bitcast [9 x i32]* %1 to i8*
%3 = tail call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([27 x i8], [27 x i8]* @.str, i64 0, i64 0), i32 6)
%4 = getelementptr inbounds [9 x i32], [9 x i32]* %1, i64 0, i64 0
%5 = call i32 @binary_search(i32* %4, i32 9, i32 6)
%6 = icmp sgt i32 %5, -1
br i1 %6, label %7, label %9
7: ; preds = %0
%8 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([25 x i8], [25 x i8]* @.str.1, i64 0, i64 0), i32 %5)
br label %11
9: ; preds = %0
%10 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([18 x i8], [18 x i8]* @str.9, i64 0, i64 0))
br label %11
11: ; preds = %9, %7
%12 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([27 x i8], [27 x i8]* @.str, i64 0, i64 0), i32 10)
%13 = call i32 @binary_search(i32* %4, i32 9, i32 10)
%14 = icmp sgt i32 %13, -1
br i1 %14, label %15, label %17
15: ; preds = %11
%16 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([25 x i8], [25 x i8]* @.str.1, i64 0, i64 0), i32 %13)
br label %19
17: ; preds = %11
%18 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([18 x i8], [18 x i8]* @str.9, i64 0, i64 0))
br label %19
19: ; preds = %17, %15
%20 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([27 x i8], [27 x i8]* @.str, i64 0, i64 0), i32 5)
%21 = call i32 @binary_search(i32* %4, i32 9, i32 5)
%22 = icmp sgt i32 %21, -1
br i1 %22, label %23, label %25
23: ; preds = %19
%24 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([25 x i8], [25 x i8]* @.str.1, i64 0, i64 0), i32 %21)
br label %27
25: ; preds = %19
%26 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([18 x i8], [18 x i8]* @str.9, i64 0, i64 0))
br label %27
27: ; preds = %25, %23
%28 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([39 x i8], [39 x i8]* @.str.3, i64 0, i64 0), i32 6)
%29 = call i32 @binary_search_recursive(i32* %4, i32 0, i32 8, i32 6)
%30 = icmp sgt i32 %29, -1
br i1 %30, label %31, label %33
31: ; preds = %27
%32 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([25 x i8], [25 x i8]* @.str.1, i64 0, i64 0), i32 %29)
br label %35
33: ; preds = %27
%34 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([18 x i8], [18 x i8]* @str.9, i64 0, i64 0))
br label %35
35: ; preds = %33, %31
%36 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([39 x i8], [39 x i8]* @.str.3, i64 0, i64 0), i32 10)
%37 = call i32 @binary_search_recursive(i32* %4, i32 0, i32 8, i32 10)
%38 = icmp sgt i32 %37, -1
br i1 %38, label %39, label %41
39: ; preds = %35
%40 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([25 x i8], [25 x i8]* @.str.1, i64 0, i64 0), i32 %37)
br label %43
41: ; preds = %35
%42 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([18 x i8], [18 x i8]* @str.9, i64 0, i64 0))
br label %43
43: ; preds = %41, %39
%44 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([39 x i8], [39 x i8]* @.str.3, i64 0, i64 0), i32 -1)
%45 = call i32 @binary_search_recursive(i32* %4, i32 0, i32 8, i32 -1)
%46 = icmp sgt i32 %45, -1
br i1 %46, label %47, label %49
47: ; preds = %43
%48 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([25 x i8], [25 x i8]* @.str.1, i64 0, i64 0), i32 %45)
br label %51
49: ; preds = %43
%50 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([18 x i8], [18 x i8]* @str.9, i64 0, i64 0))
br label %51
51: ; preds = %49, %47
%52 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([39 x i8], [39 x i8]* @.str.3, i64 0, i64 0), i32 5)
%53 = call i32 @binary_search_recursive(i32* %4, i32 0, i32 8, i32 5)
%54 = icmp sgt i32 %53, -1
br i1 %54, label %55, label %57
55: ; preds = %51
%56 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([25 x i8], [25 x i8]* @.str.1, i64 0, i64 0), i32 %53)
br label %59
57: ; preds = %51
%58 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([18 x i8], [18 x i8]* @str.9, i64 0, i64 0))
br label %59
59: ; preds = %57, %55
ret i32 0
}