#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 */
double findKth(int *, int, int *, int, int);
double findMedianSortedArrays(int *nums1, int nums1Size, int *nums2,
                              int nums2Size) {
  int total = nums1Size + nums2Size;
  if (total & 1)
    return findKth(nums1, nums1Size, nums2, nums2Size, total / 2 + 1);
  else
    return ((double)(findKth(nums1, nums1Size, nums2, nums2Size, total / 2) +
                     findKth(nums1, nums1Size, nums2, nums2Size,
                             total / 2 + 1))) /
           2;
}


x86 assembly (clang, -O0):
<findMedianSortedArrays>:
push   %rbp
mov    %rsp,%rbp
sub    $0x50,%rsp
mov    %rdi,-0x10(%rbp)
mov    %esi,-0x14(%rbp)
mov    %rdx,-0x20(%rbp)
mov    %ecx,-0x24(%rbp)
mov    -0x14(%rbp),%eax
add    -0x24(%rbp),%eax
mov    %eax,-0x28(%rbp)
mov    -0x28(%rbp),%eax
and    $0x1,%eax
cmp    $0x0,%eax
je     1177 <findMedianSortedArrays+0x67>
mov    -0x10(%rbp),%rdi
mov    -0x14(%rbp),%esi
mov    -0x20(%rbp),%rax
mov    %rax,-0x30(%rbp)
mov    -0x24(%rbp),%ecx
mov    -0x28(%rbp),%eax
mov    $0x2,%r8d
cltd
idiv   %r8d
mov    -0x30(%rbp),%rdx
mov    %eax,%r8d
add    $0x1,%r8d
call   1030 <findKth@plt>
movsd  %xmm0,-0x8(%rbp)
jmp    11f3 <findMedianSortedArrays+0xe3>
mov    -0x10(%rbp),%rdi
mov    -0x14(%rbp),%esi
mov    -0x20(%rbp),%rax
mov    %rax,-0x48(%rbp)
mov    -0x24(%rbp),%ecx
mov    -0x28(%rbp),%eax
mov    $0x2,%r8d
cltd
idiv   %r8d
mov    -0x48(%rbp),%rdx
mov    %eax,%r8d
call   1030 <findKth@plt>
movsd  %xmm0,-0x38(%rbp)
mov    -0x10(%rbp),%rdi
mov    -0x14(%rbp),%esi
mov    -0x20(%rbp),%rax
mov    %rax,-0x40(%rbp)
mov    -0x24(%rbp),%ecx
mov    -0x28(%rbp),%eax
mov    $0x2,%r8d
cltd
idiv   %r8d
mov    -0x40(%rbp),%rdx
mov    %eax,%r8d
add    $0x1,%r8d
call   1030 <findKth@plt>
movaps %xmm0,%xmm1
movsd  -0x38(%rbp),%xmm0
addsd  %xmm1,%xmm0
movsd  0xe16(%rip),%xmm1
divsd  %xmm1,%xmm0
movsd  %xmm0,-0x8(%rbp)
movsd  -0x8(%rbp),%xmm0
add    $0x50,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<findMedianSortedArrays>:
push   %rbp
push   %r15
push   %r14
push   %r12
push   %rbx
sub    $0x10,%rsp
mov    %ecx,%r15d
mov    %rdx,%r14
mov    %esi,%ebx
mov    %rdi,%r12
lea    (%r15,%rbx,1),%eax
mov    %eax,%ebp
shr    $0x1f,%ebp
add    %eax,%ebp
sar    %ebp
test   $0x1,%al
jne    1182 <findMedianSortedArrays+0x72>
mov    %r12,%rdi
mov    %ebx,%esi
mov    %r14,%rdx
mov    %r15d,%ecx
mov    %ebp,%r8d
call   1030 <findKth@plt>
movsd  %xmm0,0x8(%rsp)
add    $0x1,%ebp
mov    %r12,%rdi
mov    %ebx,%esi
mov    %r14,%rdx
mov    %r15d,%ecx
mov    %ebp,%r8d
call   1030 <findKth@plt>
addsd  0x8(%rsp),%xmm0
mulsd  0xe8b(%rip),%xmm0
add    $0x10,%rsp
pop    %rbx
pop    %r12
pop    %r14
pop    %r15
pop    %rbp
ret
add    $0x1,%ebp
mov    %r12,%rdi
mov    %ebx,%esi
mov    %r14,%rdx
mov    %r15d,%ecx
mov    %ebp,%r8d
add    $0x10,%rsp
pop    %rbx
pop    %r12
pop    %r14
pop    %r15
pop    %rbp
jmp    1030 <findKth@plt>

LLVM IR (-O0):
define double @findMedianSortedArrays(i32* %0, i32 %1, i32* %2, i32 %3) {
%5 = alloca double
%6 = alloca i32*
%7 = alloca i32
%8 = alloca i32*
%9 = alloca i32
%10 = alloca i32
store i32* %0, i32** %6
store i32 %1, i32* %7
store i32* %2, i32** %8
store i32 %3, i32* %9
%11 = load i32, i32* %7
%12 = load i32, i32* %9
%13 = add nsw i32 %11, %12
store i32 %13, i32* %10
%14 = load i32, i32* %10
%15 = and i32 %14, 1
%16 = icmp ne i32 %15, 0
br i1 %16, label %17, label %26
17: ; preds = %4
%18 = load i32*, i32** %6
%19 = load i32, i32* %7
%20 = load i32*, i32** %8
%21 = load i32, i32* %9
%22 = load i32, i32* %10
%23 = sdiv i32 %22, 2
%24 = add nsw i32 %23, 1
%25 = call double @findKth(i32* %18, i32 %19, i32* %20, i32 %21, i32 %24)
store double %25, double* %5
br label %44
26: ; preds = %4
%27 = load i32*, i32** %6
%28 = load i32, i32* %7
%29 = load i32*, i32** %8
%30 = load i32, i32* %9
%31 = load i32, i32* %10
%32 = sdiv i32 %31, 2
%33 = call double @findKth(i32* %27, i32 %28, i32* %29, i32 %30, i32 %32)
%34 = load i32*, i32** %6
%35 = load i32, i32* %7
%36 = load i32*, i32** %8
%37 = load i32, i32* %9
%38 = load i32, i32* %10
%39 = sdiv i32 %38, 2
%40 = add nsw i32 %39, 1
%41 = call double @findKth(i32* %34, i32 %35, i32* %36, i32 %37, i32 %40)
%42 = fadd double %33, %41
%43 = fdiv double %42, 2.000000e+00
store double %43, double* %5
br label %44
44: ; preds = %26, %17
%45 = load double, double* %5
ret double %45
}

LLVM IR (-O2):
define double @findMedianSortedArrays(i32* %0, i32 %1, i32* %2, i32 %3) {
%5 = add nsw i32 %3, %1
%6 = and i32 %5, 1
%7 = icmp eq i32 %6, 0
%8 = sdiv i32 %5, 2
br i1 %7, label %12, label %9
9: ; preds = %4
%10 = add nsw i32 %8, 1
%11 = tail call double @findKth(i32* %0, i32 %1, i32* %2, i32 %3, i32 %10)
br label %18
12: ; preds = %4
%13 = tail call double @findKth(i32* %0, i32 %1, i32* %2, i32 %3, i32 %8)
%14 = add nsw i32 %8, 1
%15 = tail call double @findKth(i32* %0, i32 %1, i32* %2, i32 %3, i32 %14)
%16 = fadd double %13, %15
%17 = fmul double %16, 5.000000e-01
br label %18
18: ; preds = %12, %9
%19 = phi double [ %11, %9 ], [ %17, %12 ]
ret double %19
}