#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 */

/* Variables and functions */
int /*<<< orphan*/ copy(int *, int *);
int /*<<< orphan*/ create(int *);
int /*<<< orphan*/ delete (int *, int /*<<< orphan*/);
int /*<<< orphan*/ display(int *);
int /*<<< orphan*/ getValue(char *);
int /*<<< orphan*/ initialize(int *);
int /*<<< orphan*/ insertElement(int *, int /*<<< orphan*/, int /*<<< orphan*/);
int /*<<< orphan*/ isEmpty(int *);
int isFull(int *);
int length(int *);
int /*<<< orphan*/ printf(char *, ...);
int /*<<< orphan*/ scanf(char *, int *);
int search(int *, int /*<<< orphan*/);
int /*<<< orphan*/ sort(int *);
int main() {
  int response, arr[10], result, cpy[10], mergedArray[2 * 10];
  initialize(arr);
  do {
    printf("\n\tThe list of operations you can perform on the Array ADT.\n");
    printf("\n\t1. Create\t2. Length\t3. isFull\n");
    printf("\t4. isEmpty\t5. Display\t6. Insert\n");
    printf("\t7. Delete\t8. Search\t9. Sort\n");
    printf("\t10. Copy\t11. Merge\t12. Traverse\n");
    printf("\t0. EXIT\n");
    printf("\t Enter your response? ");
    scanf("%d", &response);
    switch (response) {
    case 0:
      printf("\tYou opted to exit!\n");
      break;
    case 1:
      create(arr);
      break;
    case 2:
      printf("\tLength of the array is: %d\n", length(arr));
      break;
    case 3:
      if (isFull(arr))
        printf("\t%d the array is full.\n", isFull(arr));
      else
        printf("\t%d the array is not full.\n", isFull(arr));
      break;
    case 4:
      if (isEmpty(arr))
        printf("\t%d the array is Empty.\n", isFull(arr));
      else
        printf("\t%d the array is not Empty.\n", isFull(arr));
      break;
    case 5:
      printf("\tThe elements in the array are:\n\t");
      display(arr);
      printf("\n");
      break;
    case 6:
      insertElement(arr, getValue("the index: "), getValue("the value: "));
      break;
    case 7:
      delete (arr, getValue("the index: "));
      break;
    case 8:
      result = search(arr, getValue("the vaule to search for: "));
      if (result == -1)
        printf("\tThe element does not exist in the array!");
      else
        printf("\tElement found at index = %d", result);
      break;
    case 9:
      sort(arr);
      break;
    case 10:
      copy(arr, cpy);
      break;
    }
  } while (response != 0);
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0xe0,%rsp
movl   $0x0,-0x4(%rbp)
lea    -0x30(%rbp),%rdi
call   1080 <initialize@plt>
lea    0xe2a(%rip),%rdi
xor    %eax,%eax
mov    %al,-0xb9(%rbp)
call   1050 <printf@plt>
mov    -0xb9(%rbp),%al
lea    0xe4c(%rip),%rdi
call   1050 <printf@plt>
mov    -0xb9(%rbp),%al
lea    0xe5b(%rip),%rdi
call   1050 <printf@plt>
mov    -0xb9(%rbp),%al
lea    0xe6b(%rip),%rdi
call   1050 <printf@plt>
mov    -0xb9(%rbp),%al
lea    0xe77(%rip),%rdi
call   1050 <printf@plt>
mov    -0xb9(%rbp),%al
lea    0xe87(%rip),%rdi
call   1050 <printf@plt>
mov    -0xb9(%rbp),%al
lea    0xe7f(%rip),%rdi
call   1050 <printf@plt>
lea    0xfbf(%rip),%rdi
lea    -0x8(%rbp),%rsi
call   10e0 <scanf@plt>
mov    -0x8(%rbp),%eax
mov    %rax,-0xb8(%rbp)
sub    $0xa,%rax
ja     149d <main+0x2bd>
mov    -0xb8(%rbp),%rax
lea    0xd53(%rip),%rcx
movslq (%rcx,%rax,4),%rax
add    %rcx,%rax
jmp    *%rax
lea    0xe50(%rip),%rdi
mov    $0x0,%al
call   1050 <printf@plt>
jmp    149d <main+0x2bd>
lea    -0x30(%rbp),%rdi
call   10b0 <create@plt>
jmp    149d <main+0x2bd>
lea    -0x30(%rbp),%rdi
call   1030 <length@plt>
mov    %eax,%esi
lea    0xe39(%rip),%rdi
mov    $0x0,%al
call   1050 <printf@plt>
jmp    149d <main+0x2bd>
lea    -0x30(%rbp),%rdi
call   10f0 <isFull@plt>
cmp    $0x0,%eax
je     1325 <main+0x145>
lea    -0x30(%rbp),%rdi
call   10f0 <isFull@plt>
mov    %eax,%esi
lea    0xe26(%rip),%rdi
mov    $0x0,%al
call   1050 <printf@plt>
jmp    133e <main+0x15e>
lea    -0x30(%rbp),%rdi
call   10f0 <isFull@plt>
mov    %eax,%esi
lea    0xe20(%rip),%rdi
mov    $0x0,%al
call   1050 <printf@plt>
jmp    149d <main+0x2bd>
lea    -0x30(%rbp),%rdi
call   10c0 <isEmpty@plt>
cmp    $0x0,%eax
je     1373 <main+0x193>
lea    -0x30(%rbp),%rdi
call   10f0 <isFull@plt>
mov    %eax,%esi
lea    0xe0c(%rip),%rdi
mov    $0x0,%al
call   1050 <printf@plt>
jmp    138c <main+0x1ac>
lea    -0x30(%rbp),%rdi
call   10f0 <isFull@plt>
mov    %eax,%esi
lea    0xe07(%rip),%rdi
mov    $0x0,%al
call   1050 <printf@plt>
jmp    149d <main+0x2bd>
lea    0xe11(%rip),%rdi
mov    $0x0,%al
call   1050 <printf@plt>
lea    -0x30(%rbp),%rdi
call   1040 <display@plt>
lea    0xd71(%rip),%rdi
mov    $0x0,%al
call   1050 <printf@plt>
jmp    149d <main+0x2bd>
lea    -0x30(%rbp),%rax
mov    %rax,-0xc8(%rbp)
lea    0xdfe(%rip),%rdi
call   10a0 <getValue@plt>
mov    %eax,-0xc0(%rbp)
lea    0xdf8(%rip),%rdi
call   10a0 <getValue@plt>
mov    -0xc8(%rbp),%rdi
mov    -0xc0(%rbp),%esi
mov    %eax,%edx
call   10d0 <insertElement@plt>
jmp    149d <main+0x2bd>
lea    -0x30(%rbp),%rax
mov    %rax,-0xd0(%rbp)
lea    0xdbc(%rip),%rdi
call   10a0 <getValue@plt>
mov    -0xd0(%rbp),%rdi
mov    %eax,%esi
call   1100 <delete@plt>
jmp    149d <main+0x2bd>
lea    -0x30(%rbp),%rax
mov    %rax,-0xd8(%rbp)
lea    0xdaa(%rip),%rdi
call   10a0 <getValue@plt>
mov    -0xd8(%rbp),%rdi
mov    %eax,%esi
call   1070 <search@plt>
mov    %eax,-0x34(%rbp)
cmpl   $0xffffffff,-0x34(%rbp)
jne    146c <main+0x28c>
lea    0xd9d(%rip),%rdi
mov    $0x0,%al
call   1050 <printf@plt>
jmp    147d <main+0x29d>
mov    -0x34(%rbp),%esi
lea    0xdb1(%rip),%rdi
mov    $0x0,%al
call   1050 <printf@plt>
jmp    149d <main+0x2bd>
lea    -0x30(%rbp),%rdi
call   1060 <sort@plt>
jmp    149d <main+0x2bd>
lea    -0x30(%rbp),%rdi
lea    -0x60(%rbp),%rsi
call   1090 <copy@plt>
jmp    14a2 <main+0x2c2>
cmpl   $0x0,-0x8(%rbp)
jne    11fb <main+0x1b>
mov    -0x4(%rbp),%eax
add    $0xe0,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %rbp
push   %r15
push   %r14
push   %r13
push   %r12
push   %rbx
sub    $0x68,%rsp
lea    0x10(%rsp),%rbx
mov    %rbx,%rdi
call   10a0 <initialize@plt>
lea    0xffe(%rip),%r14
lea    0xe03(%rip),%r15
lea    0xf33(%rip),%r12
lea    0xc(%rsp),%r13
lea    0xdc4(%rip),%rbp
nopl   0x0(%rax)
lea    0xf1f(%rip),%rdi
call   1050 <puts@plt>
lea    0xf4e(%rip),%rdi
call   1050 <puts@plt>
lea    0xf62(%rip),%rdi
call   1050 <puts@plt>
lea    0xf77(%rip),%rdi
call   1050 <puts@plt>
lea    0xf88(%rip),%rdi
call   1050 <puts@plt>
mov    %r14,%rdi
call   1050 <puts@plt>
mov    %r15,%rdi
xor    %eax,%eax
call   1070 <printf@plt>
mov    %r12,%rdi
mov    %r13,%rsi
call   1100 <scanf@plt>
mov    0xc(%rsp),%eax
cmp    $0xa,%rax
ja     1414 <main+0x214>
movslq 0x0(%rbp,%rax,4),%rax
add    %rbp,%rax
jmp    *%rax
lea    0xf71(%rip),%rdi
call   1050 <puts@plt>
jmp    1410 <main+0x210>
mov    %rbx,%rdi
call   10d0 <create@plt>
jmp    1410 <main+0x210>
mov    %rbx,%rdi
call   1040 <length@plt>
lea    0xd66(%rip),%rdi
jmp    13c0 <main+0x1c0>
mov    %rbx,%rdi
call   1110 <isFull@plt>
mov    %rbx,%rdi
mov    %eax,%ebx
call   1110 <isFull@plt>
test   %ebx,%ebx
je     13e4 <main+0x1e4>
lea    0xd5d(%rip),%rdi
jmp    13f4 <main+0x1f4>
mov    %rbx,%rdi
call   10e0 <isEmpty@plt>
mov    %rbx,%rdi
mov    %eax,%ebx
call   1110 <isFull@plt>
test   %ebx,%ebx
je     13ed <main+0x1ed>
lea    0xd6b(%rip),%rdi
jmp    13f4 <main+0x1f4>
lea    0xd95(%rip),%rdi
xor    %eax,%eax
call   1070 <printf@plt>
mov    %rbx,%rdi
call   1060 <display@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
jmp    1410 <main+0x210>
lea    0xd92(%rip),%rdi
call   10c0 <getValue@plt>
mov    %eax,%ebx
lea    0xd90(%rip),%rdi
call   10c0 <getValue@plt>
lea    0x10(%rsp),%rdi
mov    %ebx,%esi
lea    0x10(%rsp),%rbx
mov    %eax,%edx
call   10f0 <insertElement@plt>
jmp    1410 <main+0x210>
lea    0xd60(%rip),%rdi
call   10c0 <getValue@plt>
mov    %rbx,%rdi
mov    %eax,%esi
call   1120 <delete@plt>
jmp    1410 <main+0x210>
lea    0xd60(%rip),%rdi
call   10c0 <getValue@plt>
mov    %rbx,%rdi
mov    %eax,%esi
call   1090 <search@plt>
cmp    $0xffffffff,%eax
je     141e <main+0x21e>
lea    0xd89(%rip),%rdi
mov    %eax,%esi
xor    %eax,%eax
call   1070 <printf@plt>
jmp    1410 <main+0x210>
mov    %rbx,%rdi
call   1080 <sort@plt>
jmp    1410 <main+0x210>
mov    %rbx,%rdi
lea    0x40(%rsp),%rsi
call   10b0 <copy@plt>
jmp    1410 <main+0x210>
lea    0xc8e(%rip),%rdi
jmp    13f4 <main+0x1f4>
lea    0xcba(%rip),%rdi
mov    %eax,%esi
xor    %eax,%eax
call   1070 <printf@plt>
lea    0x10(%rsp),%rbx
cs nopw 0x0(%rax,%rax,1)
nopl   0x0(%rax)
mov    0xc(%rsp),%eax
test   %eax,%eax
jne    1240 <main+0x40>
jmp    142e <main+0x22e>
lea    0xcfa(%rip),%rdi
xor    %eax,%eax
call   1070 <printf@plt>
jmp    1410 <main+0x210>
xor    %eax,%eax
add    $0x68,%rsp
pop    %rbx
pop    %r12
pop    %r13
pop    %r14
pop    %r15
pop    %rbp
ret

LLVM IR (-O0):
@.str = [60 x i8] c"\0A\09The list of operations you can perform on the Array ADT.\0A\00"
@.str.1 = [33 x i8] c"\0A\091. Create\092. Length\093. isFull\0A\00"
@.str.2 = [34 x i8] c"\094. isEmpty\095. Display\096. Insert\0A\00"
@.str.3 = [30 x i8] c"\097. Delete\098. Search\099. Sort\0A\00"
@.str.4 = [34 x i8] c"\0910. Copy\0911. Merge\0912. Traverse\0A\00"
@.str.5 = [10 x i8] c"\090. EXIT\0A\00"
@.str.6 = [24 x i8] c"\09 Enter your response? \00"
@.str.7 = [3 x i8] c"%d\00"
@.str.8 = [21 x i8] c"\09You opted to exit!\0A\00"
@.str.9 = [29 x i8] c"\09Length of the array is: %d\0A\00"
@.str.10 = [24 x i8] c"\09%d the array is full.\0A\00"
@.str.11 = [28 x i8] c"\09%d the array is not full.\0A\00"
@.str.12 = [25 x i8] c"\09%d the array is Empty.\0A\00"
@.str.13 = [29 x i8] c"\09%d the array is not Empty.\0A\00"
@.str.14 = [34 x i8] c"\09The elements in the array are:\0A\09\00"
@.str.15 = [2 x i8] c"\0A\00"
@.str.16 = [12 x i8] c"the index: \00"
@.str.17 = [12 x i8] c"the value: \00"
@.str.18 = [26 x i8] c"the vaule to search for: \00"
@.str.19 = [42 x i8] c"\09The element does not exist in the array!\00"
@.str.20 = [29 x i8] c"\09Element found at index = %d\00"
define i32 @main() {
%1 = alloca i32
%2 = alloca i32
%3 = alloca [10 x i32]
%4 = alloca i32
%5 = alloca [10 x i32]
%6 = alloca [20 x i32]
store i32 0, i32* %1
%7 = getelementptr inbounds [10 x i32], [10 x i32]* %3, i64 0, i64 0
%8 = call i32 @initialize(i32* %7)
br label %9
9: ; preds = %88, %0
%10 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([60 x i8], [60 x i8]* @.str, i64 0, i64 0))
%11 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([33 x i8], [33 x i8]* @.str.1, i64 0, i64 0))
%12 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([34 x i8], [34 x i8]* @.str.2, i64 0, i64 0))
%13 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([30 x i8], [30 x i8]* @.str.3, i64 0, i64 0))
%14 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([34 x i8], [34 x i8]* @.str.4, i64 0, i64 0))
%15 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @.str.5, i64 0, i64 0))
%16 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([24 x i8], [24 x i8]* @.str.6, i64 0, i64 0))
%17 = call i32 @scanf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.7, i64 0, i64 0), i32* %2)
%18 = load i32, i32* %2
switch i32 %18, label %87 [
i32 0, label %19
i32 1, label %21
i32 2, label %24
i32 3, label %28
i32 4, label %41
i32 5, label %54
i32 6, label %59
i32 7, label %64
i32 8, label %68
i32 9, label %80
i32 10, label %83
]
19: ; preds = %9
%20 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([21 x i8], [21 x i8]* @.str.8, i64 0, i64 0))
br label %87
21: ; preds = %9
%22 = getelementptr inbounds [10 x i32], [10 x i32]* %3, i64 0, i64 0
%23 = call i32 @create(i32* %22)
br label %87
24: ; preds = %9
%25 = getelementptr inbounds [10 x i32], [10 x i32]* %3, i64 0, i64 0
%26 = call i32 @length(i32* %25)
%27 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([29 x i8], [29 x i8]* @.str.9, i64 0, i64 0), i32 %26)
br label %87
28: ; preds = %9
%29 = getelementptr inbounds [10 x i32], [10 x i32]* %3, i64 0, i64 0
%30 = call i32 @isFull(i32* %29)
%31 = icmp ne i32 %30, 0
br i1 %31, label %32, label %36
32: ; preds = %28
%33 = getelementptr inbounds [10 x i32], [10 x i32]* %3, i64 0, i64 0
%34 = call i32 @isFull(i32* %33)
%35 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([24 x i8], [24 x i8]* @.str.10, i64 0, i64 0), i32 %34)
br label %40
36: ; preds = %28
%37 = getelementptr inbounds [10 x i32], [10 x i32]* %3, i64 0, i64 0
%38 = call i32 @isFull(i32* %37)
%39 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([28 x i8], [28 x i8]* @.str.11, i64 0, i64 0), i32 %38)
br label %40
40: ; preds = %36, %32
br label %87
41: ; preds = %9
%42 = getelementptr inbounds [10 x i32], [10 x i32]* %3, i64 0, i64 0
%43 = call i32 @isEmpty(i32* %42)
%44 = icmp ne i32 %43, 0
br i1 %44, label %45, label %49
45: ; preds = %41
%46 = getelementptr inbounds [10 x i32], [10 x i32]* %3, i64 0, i64 0
%47 = call i32 @isFull(i32* %46)
%48 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([25 x i8], [25 x i8]* @.str.12, i64 0, i64 0), i32 %47)
br label %53
49: ; preds = %41
%50 = getelementptr inbounds [10 x i32], [10 x i32]* %3, i64 0, i64 0
%51 = call i32 @isFull(i32* %50)
%52 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([29 x i8], [29 x i8]* @.str.13, i64 0, i64 0), i32 %51)
br label %53
53: ; preds = %49, %45
br label %87
54: ; preds = %9
%55 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([34 x i8], [34 x i8]* @.str.14, i64 0, i64 0))
%56 = getelementptr inbounds [10 x i32], [10 x i32]* %3, i64 0, i64 0
%57 = call i32 @display(i32* %56)
%58 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.15, i64 0, i64 0))
br label %87
59: ; preds = %9
%60 = getelementptr inbounds [10 x i32], [10 x i32]* %3, i64 0, i64 0
%61 = call i32 @getValue(i8* getelementptr inbounds ([12 x i8], [12 x i8]* @.str.16, i64 0, i64 0))
%62 = call i32 @getValue(i8* getelementptr inbounds ([12 x i8], [12 x i8]* @.str.17, i64 0, i64 0))
%63 = call i32 @insertElement(i32* %60, i32 %61, i32 %62)
br label %87
64: ; preds = %9
%65 = getelementptr inbounds [10 x i32], [10 x i32]* %3, i64 0, i64 0
%66 = call i32 @getValue(i8* getelementptr inbounds ([12 x i8], [12 x i8]* @.str.16, i64 0, i64 0))
%67 = call i32 @delete(i32* %65, i32 %66)
br label %87
68: ; preds = %9
%69 = getelementptr inbounds [10 x i32], [10 x i32]* %3, i64 0, i64 0
%70 = call i32 @getValue(i8* getelementptr inbounds ([26 x i8], [26 x i8]* @.str.18, i64 0, i64 0))
%71 = call i32 @search(i32* %69, i32 %70)
store i32 %71, i32* %4
%72 = load i32, i32* %4
%73 = icmp eq i32 %72, -1
br i1 %73, label %74, label %76
74: ; preds = %68
%75 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([42 x i8], [42 x i8]* @.str.19, i64 0, i64 0))
br label %79
76: ; preds = %68
%77 = load i32, i32* %4
%78 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([29 x i8], [29 x i8]* @.str.20, i64 0, i64 0), i32 %77)
br label %79
79: ; preds = %76, %74
br label %87
80: ; preds = %9
%81 = getelementptr inbounds [10 x i32], [10 x i32]* %3, i64 0, i64 0
%82 = call i32 @sort(i32* %81)
br label %87
83: ; preds = %9
%84 = getelementptr inbounds [10 x i32], [10 x i32]* %3, i64 0, i64 0
%85 = getelementptr inbounds [10 x i32], [10 x i32]* %5, i64 0, i64 0
%86 = call i32 @copy(i32* %84, i32* %85)
br label %87
87: ; preds = %9, %83, %80, %79, %64, %59, %54, %53, %40, %24, %21, %19
br label %88
88: ; preds = %87
%89 = load i32, i32* %2
%90 = icmp ne i32 %89, 0
br i1 %90, label %9, label %91
91: ; preds = %88
%92 = load i32, i32* %1
ret i32 %92
}

LLVM IR (-O2):
@.str.6 = [24 x i8] c"\09 Enter your response? \00"
@.str.7 = [3 x i8] c"%d\00"
@.str.9 = [29 x i8] c"\09Length of the array is: %d\0A\00"
@.str.10 = [24 x i8] c"\09%d the array is full.\0A\00"
@.str.11 = [28 x i8] c"\09%d the array is not full.\0A\00"
@.str.12 = [25 x i8] c"\09%d the array is Empty.\0A\00"
@.str.13 = [29 x i8] c"\09%d the array is not Empty.\0A\00"
@.str.14 = [34 x i8] c"\09The elements in the array are:\0A\09\00"
@.str.16 = [12 x i8] c"the index: \00"
@.str.17 = [12 x i8] c"the value: \00"
@.str.18 = [26 x i8] c"the vaule to search for: \00"
@.str.19 = [42 x i8] c"\09The element does not exist in the array!\00"
@.str.20 = [29 x i8] c"\09Element found at index = %d\00"
@str = [59 x i8] c"\0A\09The list of operations you can perform on the Array ADT.\00"
@str.21 = [32 x i8] c"\0A\091. Create\092. Length\093. isFull\00"
@str.22 = [33 x i8] c"\094. isEmpty\095. Display\096. Insert\00"
@str.23 = [29 x i8] c"\097. Delete\098. Search\099. Sort\00"
@str.24 = [33 x i8] c"\0910. Copy\0911. Merge\0912. Traverse\00"
@str.25 = [9 x i8] c"\090. EXIT\00"
@str.26 = [20 x i8] c"\09You opted to exit!\00"
define i32 @main() {
%1 = alloca i32
%2 = alloca [10 x i32]
%3 = alloca [10 x i32]
%4 = bitcast i32* %1 to i8*
%5 = bitcast [10 x i32]* %2 to i8*
%6 = bitcast [10 x i32]* %3 to i8*
%7 = getelementptr inbounds [10 x i32], [10 x i32]* %2, i64 0, i64 0
%8 = call i32 @initialize(i32* %7)
%9 = getelementptr inbounds [10 x i32], [10 x i32]* %3, i64 0, i64 0
br label %10
10: ; preds = %68, %0
%11 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([59 x i8], [59 x i8]* @str, i64 0, i64 0))
%12 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([32 x i8], [32 x i8]* @str.21, i64 0, i64 0))
%13 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([33 x i8], [33 x i8]* @str.22, i64 0, i64 0))
%14 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([29 x i8], [29 x i8]* @str.23, i64 0, i64 0))
%15 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([33 x i8], [33 x i8]* @str.24, i64 0, i64 0))
%16 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([9 x i8], [9 x i8]* @str.25, i64 0, i64 0))
%17 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([24 x i8], [24 x i8]* @.str.6, i64 0, i64 0))
%18 = call i32 @scanf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.7, i64 0, i64 0), i32* %1)
%19 = load i32, i32* %1
switch i32 %19, label %68 [
i32 0, label %20
i32 1, label %22
i32 2, label %24
i32 3, label %27
i32 4, label %35
i32 5, label %43
i32 6, label %47
i32 7, label %51
i32 8, label %54
i32 9, label %62
i32 10, label %64
]
20: ; preds = %10
%21 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([20 x i8], [20 x i8]* @str.26, i64 0, i64 0))
br label %66
22: ; preds = %10
%23 = call i32 @create(i32* %7)
br label %66
24: ; preds = %10
%25 = call i32 @length(i32* %7)
%26 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([29 x i8], [29 x i8]* @.str.9, i64 0, i64 0), i32 %25)
br label %66
27: ; preds = %10
%28 = call i32 @isFull(i32* %7)
%29 = icmp eq i32 %28, 0
%30 = call i32 @isFull(i32* %7)
br i1 %29, label %33, label %31
31: ; preds = %27
%32 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([24 x i8], [24 x i8]* @.str.10, i64 0, i64 0), i32 %30)
br label %66
33: ; preds = %27
%34 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([28 x i8], [28 x i8]* @.str.11, i64 0, i64 0), i32 %30)
br label %66
35: ; preds = %10
%36 = call i32 @isEmpty(i32* %7)
%37 = icmp eq i32 %36, 0
%38 = call i32 @isFull(i32* %7)
br i1 %37, label %41, label %39
39: ; preds = %35
%40 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([25 x i8], [25 x i8]* @.str.12, i64 0, i64 0), i32 %38)
br label %66
41: ; preds = %35
%42 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([29 x i8], [29 x i8]* @.str.13, i64 0, i64 0), i32 %38)
br label %66
43: ; preds = %10
%44 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([34 x i8], [34 x i8]* @.str.14, i64 0, i64 0))
%45 = call i32 @display(i32* %7)
%46 = call i32 @putchar(i32 10)
br label %66
47: ; preds = %10
%48 = call i32 @getValue(i8* getelementptr inbounds ([12 x i8], [12 x i8]* @.str.16, i64 0, i64 0))
%49 = call i32 @getValue(i8* getelementptr inbounds ([12 x i8], [12 x i8]* @.str.17, i64 0, i64 0))
%50 = call i32 @insertElement(i32* %7, i32 %48, i32 %49)
br label %66
51: ; preds = %10
%52 = call i32 @getValue(i8* getelementptr inbounds ([12 x i8], [12 x i8]* @.str.16, i64 0, i64 0))
%53 = call i32 @delete(i32* %7, i32 %52)
br label %66
54: ; preds = %10
%55 = call i32 @getValue(i8* getelementptr inbounds ([26 x i8], [26 x i8]* @.str.18, i64 0, i64 0))
%56 = call i32 @search(i32* %7, i32 %55)
%57 = icmp eq i32 %56, -1
br i1 %57, label %58, label %60
58: ; preds = %54
%59 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([42 x i8], [42 x i8]* @.str.19, i64 0, i64 0))
br label %66
60: ; preds = %54
%61 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([29 x i8], [29 x i8]* @.str.20, i64 0, i64 0), i32 %56)
br label %66
62: ; preds = %10
%63 = call i32 @sort(i32* %7)
br label %66
64: ; preds = %10
%65 = call i32 @copy(i32* %7, i32* %9)
br label %66
66: ; preds = %58, %60, %39, %41, %31, %33, %64, %62, %51, %47, %43, %24, %22, %20
%67 = load i32, i32* %1
br label %68
68: ; preds = %66, %10
%69 = phi i32 [ %67, %66 ], [ %19, %10 ]
%70 = icmp eq i32 %69, 0
br i1 %70, label %71, label %10
71: ; preds = %68
ret i32 0
}