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

/* Variables and functions */
int /*<<< orphan*/ printf(char *);
int /*<<< orphan*/ quickSort(int *, int);
void testQuickSort() {
  printf("---------- QuickSort ----------\n");
  {
    int data[] = {11, 99, 33, 55, 77, 66, 22, 88, 44};
    int size = sizeof(data) / sizeof(int);
    quickSort(data, size);
  }
  printf("----------\n");
  {
    int data[] = {11, 4,  99, 33, 8, 55, 9,  77, 2,
                  3,  66, 5,  22, 6, 1,  88, 7,  44};
    int size = sizeof(data) / sizeof(int);
    quickSort(data, size);
  }
  printf("----------\n");
  {
    int data[] = {88, 88, 88, 88, 88, 88, 88, 88, 88};
    int size = sizeof(data) / sizeof(int);
    quickSort(data, size);
  }
}


x86 assembly (clang, -O0):
<testQuickSort>:
push   %rbp
mov    %rsp,%rbp
sub    $0xc0,%rsp
lea    0xebe(%rip),%rdi
call   1030 <printf@plt>
lea    -0x30(%rbp),%rdi
lea    0xede(%rip),%rsi
mov    $0x24,%edx
call   1040 <memcpy@plt>
movl   $0x9,-0x34(%rbp)
lea    -0x30(%rbp),%rdi
mov    -0x34(%rbp),%esi
call   1050 <quickSort@plt>
lea    0xe9f(%rip),%rdi
call   1030 <printf@plt>
lea    -0x80(%rbp),%rdi
lea    0xeda(%rip),%rsi
mov    $0x48,%edx
call   1040 <memcpy@plt>
movl   $0x12,-0x84(%rbp)
lea    -0x80(%rbp),%rdi
mov    -0x84(%rbp),%esi
call   1050 <quickSort@plt>
lea    0xe65(%rip),%rdi
call   1030 <printf@plt>
lea    -0xb0(%rbp),%rdi
lea    0xeed(%rip),%rsi
mov    $0x24,%edx
call   1040 <memcpy@plt>
movl   $0x9,-0xb4(%rbp)
lea    -0xb0(%rbp),%rdi
mov    -0xb4(%rbp),%esi
call   1050 <quickSort@plt>
add    $0xc0,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<testQuickSort>:
push   %rbx
sub    $0x50,%rsp
lea    0xf78(%rip),%rdi
call   1030 <puts@plt>
mov    0xee9(%rip),%eax
mov    %eax,0x20(%rsp)
movaps 0xece(%rip),%xmm0
movaps %xmm0,0x10(%rsp)
movaps 0xeb2(%rip),%xmm0
movaps %xmm0,(%rsp)
mov    %rsp,%rdi
mov    $0x9,%esi
call   1040 <quickSort@plt>
lea    0xf53(%rip),%rbx
mov    %rbx,%rdi
call   1030 <puts@plt>
mov    0xefb(%rip),%rax
mov    %rax,0x40(%rsp)
movaps 0xedf(%rip),%xmm0
movaps %xmm0,0x30(%rsp)
movaps 0xec3(%rip),%xmm0
movaps %xmm0,0x20(%rsp)
movaps 0xea7(%rip),%xmm0
movaps %xmm0,0x10(%rsp)
movaps 0xe8b(%rip),%xmm0
movaps %xmm0,(%rsp)
mov    %rsp,%rdi
mov    $0x12,%esi
call   1040 <quickSort@plt>
mov    %rbx,%rdi
call   1030 <puts@plt>
mov    0xedc(%rip),%eax
mov    %eax,0x20(%rsp)
movaps 0xec1(%rip),%xmm0
movaps %xmm0,0x10(%rsp)
movaps 0xea5(%rip),%xmm0
movaps %xmm0,(%rsp)
mov    %rsp,%rdi
mov    $0x9,%esi
call   1040 <quickSort@plt>
add    $0x50,%rsp
pop    %rbx
ret

LLVM IR (-O0):
@.str = [33 x i8] c"---------- QuickSort ----------\0A\00"
@__const.testQuickSort.data = [9 x i32] [i32 11, i32 99, i32 33, i32 55, i32 77, i32 66, i32 22, i32 88, i32 44]
@.str.1 = [12 x i8] c"----------\0A\00"
@__const.testQuickSort.data.2 = [18 x i32] [i32 11, i32 4, i32 99, i32 33, i32 8, i32 55, i32 9, i32 77, i32 2, i32 3, i32 66, i32 5, i32 22, i32 6, i32 1, i32 88, i32 7, i32 44]
@__const.testQuickSort.data.3 = [9 x i32] [i32 88, i32 88, i32 88, i32 88, i32 88, i32 88, i32 88, i32 88, i32 88]
define void @testQuickSort() {
%1 = alloca [9 x i32]
%2 = alloca i32
%3 = alloca [18 x i32]
%4 = alloca i32
%5 = alloca [9 x i32]
%6 = alloca i32
%7 = call i32 @printf(i8* getelementptr inbounds ([33 x i8], [33 x i8]* @.str, i64 0, i64 0))
%8 = bitcast [9 x i32]* %1 to i8*
store i32 9, i32* %2
%9 = getelementptr inbounds [9 x i32], [9 x i32]* %1, i64 0, i64 0
%10 = load i32, i32* %2
%11 = call i32 @quickSort(i32* %9, i32 %10)
%12 = call i32 @printf(i8* getelementptr inbounds ([12 x i8], [12 x i8]* @.str.1, i64 0, i64 0))
%13 = bitcast [18 x i32]* %3 to i8*
store i32 18, i32* %4
%14 = getelementptr inbounds [18 x i32], [18 x i32]* %3, i64 0, i64 0
%15 = load i32, i32* %4
%16 = call i32 @quickSort(i32* %14, i32 %15)
%17 = call i32 @printf(i8* getelementptr inbounds ([12 x i8], [12 x i8]* @.str.1, i64 0, i64 0))
%18 = bitcast [9 x i32]* %5 to i8*
store i32 9, i32* %6
%19 = getelementptr inbounds [9 x i32], [9 x i32]* %5, i64 0, i64 0
%20 = load i32, i32* %6
%21 = call i32 @quickSort(i32* %19, i32 %20)
ret void
}

LLVM IR (-O2):
@__const.testQuickSort.data = [9 x i32] [i32 11, i32 99, i32 33, i32 55, i32 77, i32 66, i32 22, i32 88, i32 44]
@__const.testQuickSort.data.2 = [18 x i32] [i32 11, i32 4, i32 99, i32 33, i32 8, i32 55, i32 9, i32 77, i32 2, i32 3, i32 66, i32 5, i32 22, i32 6, i32 1, i32 88, i32 7, i32 44]
@__const.testQuickSort.data.3 = [9 x i32] [i32 88, i32 88, i32 88, i32 88, i32 88, i32 88, i32 88, i32 88, i32 88]
@str = [32 x i8] c"---------- QuickSort ----------\00"
@str.5 = [11 x i8] c"----------\00"
define void @testQuickSort() {
%1 = alloca [9 x i32]
%2 = alloca [18 x i32]
%3 = alloca [9 x i32]
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([32 x i8], [32 x i8]* @str, i64 0, i64 0))
%5 = bitcast [9 x i32]* %1 to i8*
%6 = getelementptr inbounds [9 x i32], [9 x i32]* %1, i64 0, i64 0
%7 = call i32 @quickSort(i32* %6, i32 9)
%8 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([11 x i8], [11 x i8]* @str.5, i64 0, i64 0))
%9 = bitcast [18 x i32]* %2 to i8*
%10 = getelementptr inbounds [18 x i32], [18 x i32]* %2, i64 0, i64 0
%11 = call i32 @quickSort(i32* %10, i32 18)
%12 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([11 x i8], [11 x i8]* @str.5, i64 0, i64 0))
%13 = bitcast [9 x i32]* %3 to i8*
%14 = getelementptr inbounds [9 x i32], [9 x i32]* %3, i64 0, i64 0
%15 = call i32 @quickSort(i32* %14, i32 9)
ret void
}