#include <stdio.h>
#include <stdlib.h>
#include <time.h>

int* find_max(int a[ ], unsigned n) {
    int* result = a;
    while (--n)
        if (a[n] > *result)
            result = a + n;
    return result;
}

void bubble_sort(int a[ ], unsigned n) {
    unsigned i, j;
    char f;
    for (j = 0; j < n; j++) {
        f = 1;
        for (i = 1; i < n - j; i++)
            if (a[i] < a[i - 1]) {
                a[i] += a[i - 1];
                a[i - 1] = a[i] - a[i - 1];
                a[i] -= a[i - 1];
                f = 0;
            }
        if (f)
            break;
    }
}

enum { ARR_SIZE = 10000 };

int main() {
    int a[ARR_SIZE];
    int* m;
    unsigned i;
    clock_t c0, c1, c2;
    srand((int)time(NULL));
    for (i = 0; i < ARR_SIZE; i++)
        printf("%d ", a[i] = rand());/*[0..32767]*/
    putchar('\n');
    c0 = clock();
    m = find_max(a, ARR_SIZE);
    c1 = clock();
    bubble_sort(a, ARR_SIZE);
    c2 = clock();
    printf("max = %d\nsorted array:\n", *m);
    for (i = 0; i < ARR_SIZE; i++)
        printf("%d ", a[i]);
    printf("\nc0 = %d\nc1 = %d\nc2 = %d"
        "\nclocks for searching: %d\nclocks for sorting: %d",
        c0, c1, c2, c1 - c0, c2 - c1);
    getchar();
}