#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*/ array5;
typedef int /*<<< orphan*/ array4;
typedef int /*<<< orphan*/ array3;
typedef int /*<<< orphan*/ array2;
typedef int /*<<< orphan*/ array1;
typedef int /*<<< orphan*/ array0;

/* Variables and functions */
int /*<<< orphan*/ assert(int);
int binary_search_for_num(int *, int, int);
int linear_search_for_num(int *, int, int);
int main() {
  int array0[] = {1, 2, 3, 6, 7, 8, 9, 10, 11};
  int len0 = sizeof(array0) / sizeof(int);
  int num0 = 7;
  int exp_index0 = 4;
  assert(exp_index0 == linear_search_for_num(array0, len0, num0));
  assert(exp_index0 == binary_search_for_num(array0, len0, num0));
  int array1[] = {1, 2, 3, 6, 7, 8, 9, 10, 11};
  int len1 = sizeof(array1) / sizeof(int);
  int num1 = 11;
  int exp_index1 = 8;
  assert(exp_index1 == linear_search_for_num(array1, len1, num1));
  assert(exp_index1 == binary_search_for_num(array1, len1, num1));
  int array2[] = {1, 2, 3, 6, 7, 8, 9, 20, 22};
  int len2 = sizeof(array2) / sizeof(int);
  int num2 = 1;
  int exp_index2 = 0;
  assert(exp_index2 == linear_search_for_num(array2, len2, num2));
  assert(exp_index2 == binary_search_for_num(array2, len2, num2));
  int array3[] = {1, 2, 3, 6, 7, 8, 9, 30, 33};
  int len3 = sizeof(array3) / sizeof(int);
  int num3 = array3[len3 - 1] + 1;
  int exp_index3 = -1;
  assert(exp_index3 == linear_search_for_num(array3, len3, num3));
  assert(exp_index3 == binary_search_for_num(array3, len3, num3));
  int array4[] = {1, 2, 4, 6, 7, 8, 9, 40, 44};
  int len4 = sizeof(array4) / sizeof(int);
  int num4 = array4[0] - 1;
  int exp_index4 = -1;
  assert(exp_index4 == linear_search_for_num(array4, len4, num4));
  assert(exp_index4 == binary_search_for_num(array4, len4, num4));
  int array5[] = {1, 3, 5, 6, 7, 8, 9, 50, 55};
  int len5 = sizeof(array5) / sizeof(int);
  int num5 = array5[0] + 1;
  int exp_index5 = -1;
  assert(exp_index5 == linear_search_for_num(array5, len5, num5));
  assert(exp_index5 == binary_search_for_num(array5, len5, num5));
  return (0);
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x160,%rsp
movl   $0x0,-0x4(%rbp)
lea    -0x30(%rbp),%rdi
lea    0xea3(%rip),%rsi
mov    $0x24,%edx
call   1050 <memcpy@plt>
movl   $0x9,-0x34(%rbp)
movl   $0x7,-0x38(%rbp)
movl   $0x4,-0x3c(%rbp)
mov    -0x3c(%rbp),%eax
mov    %eax,-0x15c(%rbp)
lea    -0x30(%rbp),%rdi
mov    -0x34(%rbp),%esi
mov    -0x38(%rbp),%edx
call   1030 <linear_search_for_num@plt>
mov    %eax,%ecx
mov    -0x15c(%rbp),%eax
cmp    %ecx,%eax
sete   %al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
mov    -0x3c(%rbp),%eax
mov    %eax,-0x158(%rbp)
lea    -0x30(%rbp),%rdi
mov    -0x34(%rbp),%esi
mov    -0x38(%rbp),%edx
call   1060 <binary_search_for_num@plt>
mov    %eax,%ecx
mov    -0x158(%rbp),%eax
cmp    %ecx,%eax
sete   %al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
lea    -0x60(%rbp),%rdi
lea    0xe4b(%rip),%rsi
mov    $0x24,%edx
call   1050 <memcpy@plt>
movl   $0x9,-0x64(%rbp)
movl   $0xb,-0x68(%rbp)
movl   $0x8,-0x6c(%rbp)
mov    -0x6c(%rbp),%eax
mov    %eax,-0x154(%rbp)
lea    -0x60(%rbp),%rdi
mov    -0x64(%rbp),%esi
mov    -0x68(%rbp),%edx
call   1030 <linear_search_for_num@plt>
mov    %eax,%ecx
mov    -0x154(%rbp),%eax
cmp    %ecx,%eax
sete   %al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
mov    -0x6c(%rbp),%eax
mov    %eax,-0x150(%rbp)
lea    -0x60(%rbp),%rdi
mov    -0x64(%rbp),%esi
mov    -0x68(%rbp),%edx
call   1060 <binary_search_for_num@plt>
mov    %eax,%ecx
mov    -0x150(%rbp),%eax
cmp    %ecx,%eax
sete   %al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
lea    -0x90(%rbp),%rdi
lea    0xdf0(%rip),%rsi
mov    $0x24,%edx
call   1050 <memcpy@plt>
movl   $0x9,-0x94(%rbp)
movl   $0x1,-0x98(%rbp)
movl   $0x0,-0x9c(%rbp)
mov    -0x9c(%rbp),%eax
mov    %eax,-0x14c(%rbp)
lea    -0x90(%rbp),%rdi
mov    -0x94(%rbp),%esi
mov    -0x98(%rbp),%edx
call   1030 <linear_search_for_num@plt>
mov    %eax,%ecx
mov    -0x14c(%rbp),%eax
cmp    %ecx,%eax
sete   %al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
mov    -0x9c(%rbp),%eax
mov    %eax,-0x148(%rbp)
lea    -0x90(%rbp),%rdi
mov    -0x94(%rbp),%esi
mov    -0x98(%rbp),%edx
call   1060 <binary_search_for_num@plt>
mov    %eax,%ecx
mov    -0x148(%rbp),%eax
cmp    %ecx,%eax
sete   %al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
lea    -0xc0(%rbp),%rdi
lea    0xd74(%rip),%rsi
mov    $0x24,%edx
call   1050 <memcpy@plt>
movl   $0x9,-0xc4(%rbp)
mov    -0xc4(%rbp),%eax
sub    $0x1,%eax
cltq
mov    -0xc0(%rbp,%rax,4),%eax
add    $0x1,%eax
mov    %eax,-0xc8(%rbp)
movl   $0xffffffff,-0xcc(%rbp)
ff ff ff
mov    -0xcc(%rbp),%eax
mov    %eax,-0x144(%rbp)
lea    -0xc0(%rbp),%rdi
mov    -0xc4(%rbp),%esi
mov    -0xc8(%rbp),%edx
call   1030 <linear_search_for_num@plt>
mov    %eax,%ecx
mov    -0x144(%rbp),%eax
cmp    %ecx,%eax
sete   %al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
mov    -0xcc(%rbp),%eax
mov    %eax,-0x140(%rbp)
lea    -0xc0(%rbp),%rdi
mov    -0xc4(%rbp),%esi
mov    -0xc8(%rbp),%edx
call   1060 <binary_search_for_num@plt>
mov    %eax,%ecx
mov    -0x140(%rbp),%eax
cmp    %ecx,%eax
sete   %al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
lea    -0xf0(%rbp),%rdi
lea    0xce7(%rip),%rsi
mov    $0x24,%edx
call   1050 <memcpy@plt>
movl   $0x9,-0xf4(%rbp)
mov    -0xf0(%rbp),%eax
sub    $0x1,%eax
mov    %eax,-0xf8(%rbp)
movl   $0xffffffff,-0xfc(%rbp)
ff ff ff
mov    -0xfc(%rbp),%eax
mov    %eax,-0x13c(%rbp)
lea    -0xf0(%rbp),%rdi
mov    -0xf4(%rbp),%esi
mov    -0xf8(%rbp),%edx
call   1030 <linear_search_for_num@plt>
mov    %eax,%ecx
mov    -0x13c(%rbp),%eax
cmp    %ecx,%eax
sete   %al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
mov    -0xfc(%rbp),%eax
mov    %eax,-0x138(%rbp)
lea    -0xf0(%rbp),%rdi
mov    -0xf4(%rbp),%esi
mov    -0xf8(%rbp),%edx
call   1060 <binary_search_for_num@plt>
mov    %eax,%ecx
mov    -0x138(%rbp),%eax
cmp    %ecx,%eax
sete   %al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
lea    -0x120(%rbp),%rdi
lea    0xc66(%rip),%rsi
mov    $0x24,%edx
call   1050 <memcpy@plt>
movl   $0x9,-0x124(%rbp)
mov    -0x120(%rbp),%eax
add    $0x1,%eax
mov    %eax,-0x128(%rbp)
movl   $0xffffffff,-0x12c(%rbp)
ff ff ff
mov    -0x12c(%rbp),%eax
mov    %eax,-0x134(%rbp)
lea    -0x120(%rbp),%rdi
mov    -0x124(%rbp),%esi
mov    -0x128(%rbp),%edx
call   1030 <linear_search_for_num@plt>
mov    %eax,%ecx
mov    -0x134(%rbp),%eax
cmp    %ecx,%eax
sete   %al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
mov    -0x12c(%rbp),%eax
mov    %eax,-0x130(%rbp)
lea    -0x120(%rbp),%rdi
mov    -0x124(%rbp),%esi
mov    -0x128(%rbp),%edx
call   1060 <binary_search_for_num@plt>
mov    %eax,%ecx
mov    -0x130(%rbp),%eax
cmp    %ecx,%eax
sete   %al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
xor    %eax,%eax
add    $0x160,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %rbp
push   %rbx
sub    $0x118,%rsp
mov    0xee1(%rip),%ebp
mov    %ebp,0x110(%rsp)
movaps 0xec3(%rip),%xmm0
movaps %xmm0,0x100(%rsp)
movaps 0xea4(%rip),%xmm0
movaps %xmm0,0xf0(%rsp)
lea    0xf0(%rsp),%rbx
mov    %rbx,%rdi
mov    $0x9,%esi
mov    $0x7,%edx
call   1030 <linear_search_for_num@plt>
xor    %edi,%edi
cmp    $0x4,%eax
sete   %dil
call   1040 <assert@plt>
mov    %rbx,%rdi
mov    $0x9,%esi
mov    $0x7,%edx
call   1050 <binary_search_for_num@plt>
xor    %edi,%edi
cmp    $0x4,%eax
sete   %dil
call   1040 <assert@plt>
mov    %ebp,0xe0(%rsp)
movaps 0xe56(%rip),%xmm0
movaps %xmm0,0xd0(%rsp)
movaps 0xe37(%rip),%xmm0
movaps %xmm0,0xc0(%rsp)
lea    0xc0(%rsp),%rbx
mov    %rbx,%rdi
mov    $0x9,%esi
mov    $0xb,%edx
call   1030 <linear_search_for_num@plt>
xor    %edi,%edi
cmp    $0x8,%eax
sete   %dil
call   1040 <assert@plt>
mov    %rbx,%rdi
mov    $0x9,%esi
mov    $0xb,%edx
call   1050 <binary_search_for_num@plt>
xor    %edi,%edi
cmp    $0x8,%eax
sete   %dil
call   1040 <assert@plt>
mov    0xe31(%rip),%eax
mov    %eax,0xb0(%rsp)
movaps 0xe13(%rip),%xmm0
movaps %xmm0,0xa0(%rsp)
movaps 0xdf4(%rip),%xmm0
movaps %xmm0,0x90(%rsp)
lea    0x90(%rsp),%rbx
mov    %rbx,%rdi
mov    $0x9,%esi
mov    $0x1,%edx
call   1030 <linear_search_for_num@plt>
xor    %edi,%edi
test   %eax,%eax
sete   %dil
call   1040 <assert@plt>
mov    %rbx,%rdi
mov    $0x9,%esi
mov    $0x1,%edx
call   1050 <binary_search_for_num@plt>
xor    %edi,%edi
test   %eax,%eax
sete   %dil
call   1040 <assert@plt>
mov    0xdf0(%rip),%eax
mov    %eax,0x80(%rsp)
movaps 0xdd2(%rip),%xmm0
movaps %xmm0,0x70(%rsp)
movaps 0xdb6(%rip),%xmm0
movaps %xmm0,0x60(%rsp)
lea    0x60(%rsp),%rbx
mov    %rbx,%rdi
mov    $0x9,%esi
mov    $0x22,%edx
call   1030 <linear_search_for_num@plt>
xor    %edi,%edi
cmp    $0xffffffff,%eax
sete   %dil
call   1040 <assert@plt>
mov    %rbx,%rdi
mov    $0x9,%esi
mov    $0x22,%edx
call   1050 <binary_search_for_num@plt>
xor    %edi,%edi
cmp    $0xffffffff,%eax
sete   %dil
call   1040 <assert@plt>
mov    0xdb6(%rip),%eax
mov    %eax,0x50(%rsp)
movaps 0xd9b(%rip),%xmm0
movaps %xmm0,0x40(%rsp)
movaps 0xd7f(%rip),%xmm0
movaps %xmm0,0x30(%rsp)
lea    0x30(%rsp),%rbx
mov    %rbx,%rdi
mov    $0x9,%esi
xor    %edx,%edx
call   1030 <linear_search_for_num@plt>
xor    %edi,%edi
cmp    $0xffffffff,%eax
sete   %dil
call   1040 <assert@plt>
mov    %rbx,%rdi
mov    $0x9,%esi
xor    %edx,%edx
call   1050 <binary_search_for_num@plt>
xor    %edi,%edi
cmp    $0xffffffff,%eax
sete   %dil
call   1040 <assert@plt>
mov    0xd85(%rip),%eax
mov    %eax,0x20(%rsp)
movaps 0xd6a(%rip),%xmm0
movaps %xmm0,0x10(%rsp)
movaps 0xd4e(%rip),%xmm0
movaps %xmm0,(%rsp)
mov    %rsp,%rbx
mov    %rbx,%rdi
mov    $0x9,%esi
mov    $0x2,%edx
call   1030 <linear_search_for_num@plt>
xor    %edi,%edi
cmp    $0xffffffff,%eax
sete   %dil
call   1040 <assert@plt>
mov    %rbx,%rdi
mov    $0x9,%esi
mov    $0x2,%edx
call   1050 <binary_search_for_num@plt>
xor    %edi,%edi
cmp    $0xffffffff,%eax
sete   %dil
call   1040 <assert@plt>
xor    %eax,%eax
add    $0x118,%rsp
pop    %rbx
pop    %rbp
ret

LLVM IR (-O0):
@__const.main.array0 = [9 x i32] [i32 1, i32 2, i32 3, i32 6, i32 7, i32 8, i32 9, i32 10, i32 11]
@__const.main.array1 = [9 x i32] [i32 1, i32 2, i32 3, i32 6, i32 7, i32 8, i32 9, i32 10, i32 11]
@__const.main.array2 = [9 x i32] [i32 1, i32 2, i32 3, i32 6, i32 7, i32 8, i32 9, i32 20, i32 22]
@__const.main.array3 = [9 x i32] [i32 1, i32 2, i32 3, i32 6, i32 7, i32 8, i32 9, i32 30, i32 33]
@__const.main.array4 = [9 x i32] [i32 1, i32 2, i32 4, i32 6, i32 7, i32 8, i32 9, i32 40, i32 44]
@__const.main.array5 = [9 x i32] [i32 1, i32 3, i32 5, i32 6, i32 7, i32 8, i32 9, i32 50, i32 55]
define i32 @main() {
%1 = alloca i32
%2 = alloca [9 x i32]
%3 = alloca i32
%4 = alloca i32
%5 = alloca i32
%6 = alloca [9 x i32]
%7 = alloca i32
%8 = alloca i32
%9 = alloca i32
%10 = alloca [9 x i32]
%11 = alloca i32
%12 = alloca i32
%13 = alloca i32
%14 = alloca [9 x i32]
%15 = alloca i32
%16 = alloca i32
%17 = alloca i32
%18 = alloca [9 x i32]
%19 = alloca i32
%20 = alloca i32
%21 = alloca i32
%22 = alloca [9 x i32]
%23 = alloca i32
%24 = alloca i32
%25 = alloca i32
store i32 0, i32* %1
%26 = bitcast [9 x i32]* %2 to i8*
store i32 9, i32* %3
store i32 7, i32* %4
store i32 4, i32* %5
%27 = load i32, i32* %5
%28 = getelementptr inbounds [9 x i32], [9 x i32]* %2, i64 0, i64 0
%29 = load i32, i32* %3
%30 = load i32, i32* %4
%31 = call i32 @linear_search_for_num(i32* %28, i32 %29, i32 %30)
%32 = icmp eq i32 %27, %31
%33 = zext i1 %32 to i32
%34 = call i32 @assert(i32 %33)
%35 = load i32, i32* %5
%36 = getelementptr inbounds [9 x i32], [9 x i32]* %2, i64 0, i64 0
%37 = load i32, i32* %3
%38 = load i32, i32* %4
%39 = call i32 @binary_search_for_num(i32* %36, i32 %37, i32 %38)
%40 = icmp eq i32 %35, %39
%41 = zext i1 %40 to i32
%42 = call i32 @assert(i32 %41)
%43 = bitcast [9 x i32]* %6 to i8*
store i32 9, i32* %7
store i32 11, i32* %8
store i32 8, i32* %9
%44 = load i32, i32* %9
%45 = getelementptr inbounds [9 x i32], [9 x i32]* %6, i64 0, i64 0
%46 = load i32, i32* %7
%47 = load i32, i32* %8
%48 = call i32 @linear_search_for_num(i32* %45, i32 %46, i32 %47)
%49 = icmp eq i32 %44, %48
%50 = zext i1 %49 to i32
%51 = call i32 @assert(i32 %50)
%52 = load i32, i32* %9
%53 = getelementptr inbounds [9 x i32], [9 x i32]* %6, i64 0, i64 0
%54 = load i32, i32* %7
%55 = load i32, i32* %8
%56 = call i32 @binary_search_for_num(i32* %53, i32 %54, i32 %55)
%57 = icmp eq i32 %52, %56
%58 = zext i1 %57 to i32
%59 = call i32 @assert(i32 %58)
%60 = bitcast [9 x i32]* %10 to i8*
store i32 9, i32* %11
store i32 1, i32* %12
store i32 0, i32* %13
%61 = load i32, i32* %13
%62 = getelementptr inbounds [9 x i32], [9 x i32]* %10, i64 0, i64 0
%63 = load i32, i32* %11
%64 = load i32, i32* %12
%65 = call i32 @linear_search_for_num(i32* %62, i32 %63, i32 %64)
%66 = icmp eq i32 %61, %65
%67 = zext i1 %66 to i32
%68 = call i32 @assert(i32 %67)
%69 = load i32, i32* %13
%70 = getelementptr inbounds [9 x i32], [9 x i32]* %10, i64 0, i64 0
%71 = load i32, i32* %11
%72 = load i32, i32* %12
%73 = call i32 @binary_search_for_num(i32* %70, i32 %71, i32 %72)
%74 = icmp eq i32 %69, %73
%75 = zext i1 %74 to i32
%76 = call i32 @assert(i32 %75)
%77 = bitcast [9 x i32]* %14 to i8*
store i32 9, i32* %15
%78 = load i32, i32* %15
%79 = sub nsw i32 %78, 1
%80 = sext i32 %79 to i64
%81 = getelementptr inbounds [9 x i32], [9 x i32]* %14, i64 0, i64 %80
%82 = load i32, i32* %81
%83 = add nsw i32 %82, 1
store i32 %83, i32* %16
store i32 -1, i32* %17
%84 = load i32, i32* %17
%85 = getelementptr inbounds [9 x i32], [9 x i32]* %14, i64 0, i64 0
%86 = load i32, i32* %15
%87 = load i32, i32* %16
%88 = call i32 @linear_search_for_num(i32* %85, i32 %86, i32 %87)
%89 = icmp eq i32 %84, %88
%90 = zext i1 %89 to i32
%91 = call i32 @assert(i32 %90)
%92 = load i32, i32* %17
%93 = getelementptr inbounds [9 x i32], [9 x i32]* %14, i64 0, i64 0
%94 = load i32, i32* %15
%95 = load i32, i32* %16
%96 = call i32 @binary_search_for_num(i32* %93, i32 %94, i32 %95)
%97 = icmp eq i32 %92, %96
%98 = zext i1 %97 to i32
%99 = call i32 @assert(i32 %98)
%100 = bitcast [9 x i32]* %18 to i8*
store i32 9, i32* %19
%101 = getelementptr inbounds [9 x i32], [9 x i32]* %18, i64 0, i64 0
%102 = load i32, i32* %101
%103 = sub nsw i32 %102, 1
store i32 %103, i32* %20
store i32 -1, i32* %21
%104 = load i32, i32* %21
%105 = getelementptr inbounds [9 x i32], [9 x i32]* %18, i64 0, i64 0
%106 = load i32, i32* %19
%107 = load i32, i32* %20
%108 = call i32 @linear_search_for_num(i32* %105, i32 %106, i32 %107)
%109 = icmp eq i32 %104, %108
%110 = zext i1 %109 to i32
%111 = call i32 @assert(i32 %110)
%112 = load i32, i32* %21
%113 = getelementptr inbounds [9 x i32], [9 x i32]* %18, i64 0, i64 0
%114 = load i32, i32* %19
%115 = load i32, i32* %20
%116 = call i32 @binary_search_for_num(i32* %113, i32 %114, i32 %115)
%117 = icmp eq i32 %112, %116
%118 = zext i1 %117 to i32
%119 = call i32 @assert(i32 %118)
%120 = bitcast [9 x i32]* %22 to i8*
store i32 9, i32* %23
%121 = getelementptr inbounds [9 x i32], [9 x i32]* %22, i64 0, i64 0
%122 = load i32, i32* %121
%123 = add nsw i32 %122, 1
store i32 %123, i32* %24
store i32 -1, i32* %25
%124 = load i32, i32* %25
%125 = getelementptr inbounds [9 x i32], [9 x i32]* %22, i64 0, i64 0
%126 = load i32, i32* %23
%127 = load i32, i32* %24
%128 = call i32 @linear_search_for_num(i32* %125, i32 %126, i32 %127)
%129 = icmp eq i32 %124, %128
%130 = zext i1 %129 to i32
%131 = call i32 @assert(i32 %130)
%132 = load i32, i32* %25
%133 = getelementptr inbounds [9 x i32], [9 x i32]* %22, i64 0, i64 0
%134 = load i32, i32* %23
%135 = load i32, i32* %24
%136 = call i32 @binary_search_for_num(i32* %133, i32 %134, i32 %135)
%137 = icmp eq i32 %132, %136
%138 = zext i1 %137 to i32
%139 = call i32 @assert(i32 %138)
ret i32 0
}

LLVM IR (-O2):
@__const.main.array1 = [9 x i32] [i32 1, i32 2, i32 3, i32 6, i32 7, i32 8, i32 9, i32 10, i32 11]
@__const.main.array2 = [9 x i32] [i32 1, i32 2, i32 3, i32 6, i32 7, i32 8, i32 9, i32 20, i32 22]
@__const.main.array3 = [9 x i32] [i32 1, i32 2, i32 3, i32 6, i32 7, i32 8, i32 9, i32 30, i32 33]
@__const.main.array4 = [9 x i32] [i32 1, i32 2, i32 4, i32 6, i32 7, i32 8, i32 9, i32 40, i32 44]
@__const.main.array5 = [9 x i32] [i32 1, i32 3, i32 5, i32 6, i32 7, i32 8, i32 9, i32 50, i32 55]
define i32 @main() {
%1 = alloca [9 x i32]
%2 = alloca [9 x i32]
%3 = alloca [9 x i32]
%4 = alloca [9 x i32]
%5 = alloca [9 x i32]
%6 = alloca [9 x i32]
%7 = bitcast [9 x i32]* %1 to i8*
%8 = getelementptr inbounds [9 x i32], [9 x i32]* %1, i64 0, i64 0
%9 = call i32 @linear_search_for_num(i32* %8, i32 9, i32 7)
%10 = icmp eq i32 %9, 4
%11 = zext i1 %10 to i32
%12 = call i32 @assert(i32 %11)
%13 = call i32 @binary_search_for_num(i32* %8, i32 9, i32 7)
%14 = icmp eq i32 %13, 4
%15 = zext i1 %14 to i32
%16 = call i32 @assert(i32 %15)
%17 = bitcast [9 x i32]* %2 to i8*
%18 = getelementptr inbounds [9 x i32], [9 x i32]* %2, i64 0, i64 0
%19 = call i32 @linear_search_for_num(i32* %18, i32 9, i32 11)
%20 = icmp eq i32 %19, 8
%21 = zext i1 %20 to i32
%22 = call i32 @assert(i32 %21)
%23 = call i32 @binary_search_for_num(i32* %18, i32 9, i32 11)
%24 = icmp eq i32 %23, 8
%25 = zext i1 %24 to i32
%26 = call i32 @assert(i32 %25)
%27 = bitcast [9 x i32]* %3 to i8*
%28 = getelementptr inbounds [9 x i32], [9 x i32]* %3, i64 0, i64 0
%29 = call i32 @linear_search_for_num(i32* %28, i32 9, i32 1)
%30 = icmp eq i32 %29, 0
%31 = zext i1 %30 to i32
%32 = call i32 @assert(i32 %31)
%33 = call i32 @binary_search_for_num(i32* %28, i32 9, i32 1)
%34 = icmp eq i32 %33, 0
%35 = zext i1 %34 to i32
%36 = call i32 @assert(i32 %35)
%37 = bitcast [9 x i32]* %4 to i8*
%38 = getelementptr inbounds [9 x i32], [9 x i32]* %4, i64 0, i64 0
%39 = call i32 @linear_search_for_num(i32* %38, i32 9, i32 34)
%40 = icmp eq i32 %39, -1
%41 = zext i1 %40 to i32
%42 = call i32 @assert(i32 %41)
%43 = call i32 @binary_search_for_num(i32* %38, i32 9, i32 34)
%44 = icmp eq i32 %43, -1
%45 = zext i1 %44 to i32
%46 = call i32 @assert(i32 %45)
%47 = bitcast [9 x i32]* %5 to i8*
%48 = getelementptr inbounds [9 x i32], [9 x i32]* %5, i64 0, i64 0
%49 = call i32 @linear_search_for_num(i32* %48, i32 9, i32 0)
%50 = icmp eq i32 %49, -1
%51 = zext i1 %50 to i32
%52 = call i32 @assert(i32 %51)
%53 = call i32 @binary_search_for_num(i32* %48, i32 9, i32 0)
%54 = icmp eq i32 %53, -1
%55 = zext i1 %54 to i32
%56 = call i32 @assert(i32 %55)
%57 = bitcast [9 x i32]* %6 to i8*
%58 = getelementptr inbounds [9 x i32], [9 x i32]* %6, i64 0, i64 0
%59 = call i32 @linear_search_for_num(i32* %58, i32 9, i32 2)
%60 = icmp eq i32 %59, -1
%61 = zext i1 %60 to i32
%62 = call i32 @assert(i32 %61)
%63 = call i32 @binary_search_for_num(i32* %58, i32 9, i32 2)
%64 = icmp eq i32 %63, -1
%65 = zext i1 %64 to i32
%66 = call i32 @assert(i32 %65)
ret i32 0
}