user: Converte this assembly snippet into its equivalent C code:

```asm
<hybridFindMaxSubarray>:
  endbr64
  push   %rbp
  mov    %rsp,%rbp
  sub    $0x60,%rsp
  mov    %rdi,-0x48(%rbp)
  mov    %rsi,-0x50(%rbp)
  mov    %rdx,-0x58(%rbp)
  mov    %fs:0x28,%rax
  mov    %rax,-0x8(%rbp)
  xor    %eax,%eax
  mov    -0x58(%rbp),%rax
  mov    (%rax),%eax
  mov    %eax,-0x38(%rbp)
  mov    -0x50(%rbp),%rax
  mov    (%rax),%eax
  mov    %eax,-0x34(%rbp)
  mov    -0x58(%rbp),%rax
  mov    (%rax),%edx
  mov    -0x50(%rbp),%rax
  mov    (%rax),%ecx
  mov    %edx,%eax
  sub    %ecx,%eax
  cmp    $0xa,%eax
  jg     L11
  lea    -0x38(%rbp),%rdx
  lea    -0x34(%rbp),%rcx
  mov    -0x48(%rbp),%rax
  mov    %rcx,%rsi
  mov    %rax,%rdi
  call   <bruteFindMaxSubarray@plt>
  jmp    L86
L11:
  mov    -0x50(%rbp),%rax
  mov    (%rax),%edx
  mov    -0x58(%rbp),%rax
  mov    (%rax),%eax
  add    %edx,%eax
  mov    %eax,%edx
  shr    $0x1f,%edx
  add    %edx,%eax
  sar    %eax
  mov    %eax,-0x18(%rbp)
  mov    -0x50(%rbp),%rax
  mov    (%rax),%eax
  mov    %eax,-0x30(%rbp)
  mov    -0x18(%rbp),%eax
  mov    %eax,-0x2c(%rbp)
  mov    -0x18(%rbp),%eax
  add    $0x1,%eax
  mov    %eax,-0x28(%rbp)
  mov    -0x58(%rbp),%rax
  mov    (%rax),%eax
  mov    %eax,-0x24(%rbp)
  lea    -0x2c(%rbp),%rdx
  lea    -0x30(%rbp),%rcx
  mov    -0x48(%rbp),%rax
  mov    %rcx,%rsi
  mov    %rax,%rdi
  call   <hybridFindMaxSubarray>
  mov    %eax,-0x14(%rbp)
  lea    -0x24(%rbp),%rdx
  lea    -0x28(%rbp),%rcx
  mov    -0x48(%rbp),%rax
  mov    %rcx,%rsi
  mov    %rax,%rdi
  call   <hybridFindMaxSubarray>
  mov    %eax,-0x10(%rbp)
  mov    -0x58(%rbp),%rax
  mov    (%rax),%ecx
  mov    -0x50(%rbp),%rax
  mov    (%rax),%esi
  lea    -0x1c(%rbp),%r8
  lea    -0x20(%rbp),%rdi
  mov    -0x18(%rbp),%edx
  mov    -0x48(%rbp),%rax
  mov    %r8,%r9
  mov    %rdi,%r8
  mov    %rax,%rdi
  call   <findMaxCrossingSubarray@plt>
  mov    %eax,-0xc(%rbp)
  mov    -0x14(%rbp),%eax
  cmp    -0x10(%rbp),%eax
  jl     L9
  mov    -0x14(%rbp),%eax
  cmp    -0xc(%rbp),%eax
  jl     L9
  mov    -0x30(%rbp),%edx
  mov    -0x50(%rbp),%rax
  mov    %edx,(%rax)
  mov    -0x2c(%rbp),%edx
  mov    -0x58(%rbp),%rax
  mov    %edx,(%rax)
  mov    -0x14(%rbp),%eax
  jmp    L86
L9:
  mov    -0x10(%rbp),%eax
  cmp    -0x14(%rbp),%eax
  jl     L35
  mov    -0x10(%rbp),%eax
  cmp    -0xc(%rbp),%eax
  jl     L35
  mov    -0x28(%rbp),%edx
  mov    -0x50(%rbp),%rax
  mov    %edx,(%rax)
  mov    -0x24(%rbp),%edx
  mov    -0x58(%rbp),%rax
  mov    %edx,(%rax)
  mov    -0x10(%rbp),%eax
  jmp    L86
L35:
  mov    -0x20(%rbp),%edx
  mov    -0x50(%rbp),%rax
  mov    %edx,(%rax)
  mov    -0x1c(%rbp),%edx
  mov    -0x58(%rbp),%rax
  mov    %edx,(%rax)
  mov    -0xc(%rbp),%eax
L86:
  mov    -0x8(%rbp),%rdx
  sub    %fs:0x28,%rdx
  je     L85
  call   <__stack_chk_fail@plt>
L85:
  leave
  ret
```

assistant: ```c
int hybridFindMaxSubarray(int *arr, int *low, int *high) {
  int deref_high = *high, deref_low = *low;
  if (*high - *low + 1 <= 11)
    return bruteFindMaxSubarray(arr, &deref_low, &deref_high);
  int mid = (*low + *high) / 2;
  int leftLow = *low, leftHigh = mid, leftSum;
  int rightLow = mid + 1, rightHigh = *high, rightSum;
  int crossLow, crossHigh, crossSum;
  leftSum = hybridFindMaxSubarray(arr, &leftLow, &leftHigh);
  rightSum = hybridFindMaxSubarray(arr, &rightLow, &rightHigh);
  crossSum = findMaxCrossingSubarray(arr, *low, mid, *high, &crossLow, &crossHigh);
  if (leftSum >= rightSum && leftSum >= crossSum) {
    *low = leftLow;
    *high = leftHigh;
    return leftSum;
  } else if (rightSum >= leftSum && rightSum >= crossSum) {
    *low = rightLow;
    *high = rightHigh;
    return rightSum;
  } else {
    *low = crossLow;
    *high = crossHigh;
    return crossSum;
  }
}
```