user: Please show me the C implementation that matches the assembly code listed below:

```asm
<qsort>:
  endbr64
  push   %r15
  mov    %rdi,%r15
  push   %r14
  push   %r13
  lea    D54(%rip),%r13
  push   %r12
  push   %rbp
  push   %rbx
  sub    $0x18,%rsp
  mov    %esi,0x4(%rsp)
  mov    %edx,0x8(%rsp)
L43:
  lea    D63(%rip),%rdi
  call   <puts@plt>
  mov    0x8(%rsp),%r12d
  mov    0x4(%rsp),%ebx
  xor    %eax,%eax
  lea    D41(%rip),%rdi
  mov    %r12d,%edx
  mov    %ebx,%esi
  call   <printf@plt>
  cmp    %r12d,%ebx
  jge    L98
  movslq %ebx,%rax
  mov    (%r15,%rax,4),%ebp
  nopl   0x0(%rax)
L36:
  lea    0x1(%rbx),%edx
  cmp    %r12d,%edx
  jg     L64
  movslq %edx,%rax
  jmp    L16
  nopl   0x0(%rax)
L123:
  lea    0x1(%rax),%edx
  add    $0x1,%rax
  cmp    %eax,%r12d
  jl     L64
L16:
  mov    (%r15,%rax,4),%r8d
  mov    %eax,%ebx
  cmp    %ebp,%r8d
  jl     L123
  mov    %eax,%ecx
  mov    %eax,%edx
  mov    %ebp,%esi
  xor    %eax,%eax
  mov    %r13,%rdi
  call   <printf@plt>
  cmp    %r12d,%ebx
  jg     L71
  movslq %r12d,%rax
  mov    %r12d,%r14d
  lea    (%r15,%rax,4),%rax
  jmp    L85
  nopl   0x0(%rax,%rax,1)
L121:
  sub    $0x4,%rax
  cmp    %r14d,%ebx
  jg     L101
L85:
  mov    (%rax),%r8d
  mov    %r14d,%r12d
  lea    -0x1(%r14),%r14d
  cmp    %ebp,%r8d
  jg     L121
  mov    %r12d,%ecx
  mov    %r12d,%edx
  mov    %ebp,%esi
  xor    %eax,%eax
  lea    D62(%rip),%rdi
  call   <printf@plt>
  mov    %r12d,%edx
  mov    %ebx,%esi
  xor    %eax,%eax
  lea    D34(%rip),%rdi
  call   <printf@plt>
  mov    %r12d,%edx
  mov    %ebx,%esi
  mov    %r15,%rdi
  call   <swap@plt>
  cmp    %ebx,%r12d
  jge    L36
  lea    0x1(%r12),%eax
  mov    %eax,0xc(%rsp)
L109:
  mov    0x4(%rsp),%esi
  mov    %r12d,%edx
  mov    %r15,%rdi
  mov    %r15,%r14
  lea    0x24(%r15),%rbp
  lea    D45(%rip),%rbx
  call   <swap@plt>
  lea    D64(%rip),%rdi
  call   <puts@plt>
  nopl   (%rax)
L82:
  mov    (%r14),%esi
  mov    %rbx,%rdi
  xor    %eax,%eax
  add    $0x4,%r14
  call   <printf@plt>
  cmp    %r14,%rbp
  jne    L82
  lea    D64(%rip),%rdi
  call   <puts@plt>
  lea    D63(%rip),%rdi
  call   <puts@plt>
  mov    0x4(%rsp),%esi
  lea    -0x1(%r12),%edx
  mov    %r15,%rdi
  call   <qsort>
  mov    0xc(%rsp),%eax
  mov    %eax,0x4(%rsp)
  jmp    L43
  nopl   0x0(%rax)
L64:
  movslq %edx,%rax
  mov    %edx,%ecx
  mov    %ebp,%esi
  mov    %r13,%rdi
  mov    (%r15,%rax,4),%r8d
  xor    %eax,%eax
  mov    %r12d,%r14d
  add    $0x1,%r12d
  call   <printf@plt>
  nopl   0x0(%rax)
L101:
  movslq %r14d,%rax
  mov    %r14d,%ecx
  mov    %r14d,%edx
  mov    %ebp,%esi
  mov    (%r15,%rax,4),%r8d
  lea    D62(%rip),%rdi
  xor    %eax,%eax
  call   <printf@plt>
  mov    %r12d,0xc(%rsp)
  mov    %r14d,%r12d
  jmp    L109
L98:
  add    $0x18,%rsp
  pop    %rbx
  pop    %rbp
  pop    %r12
  pop    %r13
  pop    %r14
  pop    %r15
  ret
L71:
  mov    %r12d,%r14d
  add    $0x1,%r12d
  jmp    L101
```

tool_calls: name: unpack_data
arguments: label: D54
data_type: string
name: unpack_data
arguments: label: D63
data_type: string
name: unpack_data
arguments: label: D41
data_type: string
name: unpack_data
arguments: label: D62
data_type: string
name: unpack_data
arguments: label: D34
data_type: string
name: unpack_data
arguments: label: D45
data_type: string
name: unpack_data
arguments: label: D64
data_type: string

tool: D54: new more than {%d} i is: %d and arr[%d] is: %d


tool: D63: #############################################

tool: D41: l is: %d +++ u is: %d


tool: D62: new less than {%d} j is: %d and arr[%d] is: %d


tool: D34: swap i:%d and j:%d


tool: D45: %d


tool: D64: -------------------

assistant: ```c
void qsort(int *arr, int l, int u) {
  printf("#############################################\n");
  printf("l is: %d +++ u is: %d\n", l, u);
  if (l >= u)
    return;
  int i = l, j = u, t = arr[l];
  int tmp = 0;
  int k = 0;
  while (i <= j) {
    i++;
    while (i <= j && arr[i] < t)
      i++;
    printf("new more than {%d} i is: %d and arr[%d] is: %d\n", t, i, i, arr[i]);
    while (i <= j && arr[j] > t)
      j--;
    printf("new less than {%d} j is: %d and arr[%d] is: %d\n", t, j, j, arr[j]);
    if (i > j)
      break;
    printf("swap i:%d and j:%d\n", i, j);
    swap(arr, i, j);
  }
  swap(arr, l, j);
  printf("-------------------\n");
  for (k = 0; k < 9; k++)
    printf("%d\n", arr[k]);
  printf("-------------------\n");
  printf("#############################################\n");
  qsort(arr, l, j - 1);
  qsort(arr, j + 1, u);
}
```