#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*/ test_binary_search_iterative();
int /*<<< orphan*/ test_binary_search_recursive();
int /*<<< orphan*/ test_bubble_sort();
int /*<<< orphan*/ test_count_set_bits();
int /*<<< orphan*/ test_fibonacci_iterative();
int /*<<< orphan*/ test_fibonacci_recursive();
int /*<<< orphan*/ test_insertion_sort();
int /*<<< orphan*/ test_linear_search();
int /*<<< orphan*/ test_merge_sort_bottom_up();
int /*<<< orphan*/ test_merge_sort_natural();
int /*<<< orphan*/ test_merge_sort_top_down();
int /*<<< orphan*/ test_quick_sort();
int /*<<< orphan*/ test_results();
int /*<<< orphan*/ test_reverse();
int /*<<< orphan*/ test_selection_sort();
int main(void) {
  test_bubble_sort();
  test_insertion_sort();
  test_merge_sort_bottom_up();
  test_merge_sort_natural();
  test_merge_sort_top_down();
  test_quick_sort();
  test_selection_sort();
  test_binary_search_iterative();
  test_binary_search_recursive();
  test_linear_search();
  test_count_set_bits();
  test_reverse();
  test_fibonacci_iterative();
  test_fibonacci_recursive();
  test_results();
  return 0;
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
movl   $0x0,-0x4(%rbp)
mov    $0x0,%al
call   1090 <test_bubble_sort@plt>
mov    $0x0,%al
call   10a0 <test_insertion_sort@plt>
mov    $0x0,%al
call   1080 <test_merge_sort_bottom_up@plt>
mov    $0x0,%al
call   1040 <test_merge_sort_natural@plt>
mov    $0x0,%al
call   1110 <test_merge_sort_top_down@plt>
mov    $0x0,%al
call   1060 <test_quick_sort@plt>
mov    $0x0,%al
call   1100 <test_selection_sort@plt>
mov    $0x0,%al
call   10c0 <test_binary_search_iterative@plt>
mov    $0x0,%al
call   10e0 <test_binary_search_recursive@plt>
mov    $0x0,%al
call   10b0 <test_linear_search@plt>
mov    $0x0,%al
call   1070 <test_count_set_bits@plt>
mov    $0x0,%al
call   10d0 <test_reverse@plt>
mov    $0x0,%al
call   1050 <test_fibonacci_iterative@plt>
mov    $0x0,%al
call   1030 <test_fibonacci_recursive@plt>
mov    $0x0,%al
call   10f0 <test_results@plt>
xor    %eax,%eax
add    $0x10,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %rax
xor    %eax,%eax
call   1090 <test_bubble_sort@plt>
xor    %eax,%eax
call   10a0 <test_insertion_sort@plt>
xor    %eax,%eax
call   1080 <test_merge_sort_bottom_up@plt>
xor    %eax,%eax
call   1040 <test_merge_sort_natural@plt>
xor    %eax,%eax
call   1110 <test_merge_sort_top_down@plt>
xor    %eax,%eax
call   1060 <test_quick_sort@plt>
xor    %eax,%eax
call   1100 <test_selection_sort@plt>
xor    %eax,%eax
call   10c0 <test_binary_search_iterative@plt>
xor    %eax,%eax
call   10e0 <test_binary_search_recursive@plt>
xor    %eax,%eax
call   10b0 <test_linear_search@plt>
xor    %eax,%eax
call   1070 <test_count_set_bits@plt>
xor    %eax,%eax
call   10d0 <test_reverse@plt>
xor    %eax,%eax
call   1050 <test_fibonacci_iterative@plt>
xor    %eax,%eax
call   1030 <test_fibonacci_recursive@plt>
xor    %eax,%eax
call   10f0 <test_results@plt>
xor    %eax,%eax
pop    %rcx
ret

LLVM IR (-O0):
define i32 @main() {
%1 = alloca i32
store i32 0, i32* %1
%2 = call i32 (...) @test_bubble_sort()
%3 = call i32 (...) @test_insertion_sort()
%4 = call i32 (...) @test_merge_sort_bottom_up()
%5 = call i32 (...) @test_merge_sort_natural()
%6 = call i32 (...) @test_merge_sort_top_down()
%7 = call i32 (...) @test_quick_sort()
%8 = call i32 (...) @test_selection_sort()
%9 = call i32 (...) @test_binary_search_iterative()
%10 = call i32 (...) @test_binary_search_recursive()
%11 = call i32 (...) @test_linear_search()
%12 = call i32 (...) @test_count_set_bits()
%13 = call i32 (...) @test_reverse()
%14 = call i32 (...) @test_fibonacci_iterative()
%15 = call i32 (...) @test_fibonacci_recursive()
%16 = call i32 (...) @test_results()
ret i32 0
}

LLVM IR (-O2):
define i32 @main() {
%1 = tail call i32 (...) @test_bubble_sort()
%2 = tail call i32 (...) @test_insertion_sort()
%3 = tail call i32 (...) @test_merge_sort_bottom_up()
%4 = tail call i32 (...) @test_merge_sort_natural()
%5 = tail call i32 (...) @test_merge_sort_top_down()
%6 = tail call i32 (...) @test_quick_sort()
%7 = tail call i32 (...) @test_selection_sort()
%8 = tail call i32 (...) @test_binary_search_iterative()
%9 = tail call i32 (...) @test_binary_search_recursive()
%10 = tail call i32 (...) @test_linear_search()
%11 = tail call i32 (...) @test_count_set_bits()
%12 = tail call i32 (...) @test_reverse()
%13 = tail call i32 (...) @test_fibonacci_iterative()
%14 = tail call i32 (...) @test_fibonacci_recursive()
%15 = tail call i32 (...) @test_results()
ret i32 0
}