AISP - LV2

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

typedef struct linkedListElement {
    int value;
    struct linkedListElement *next;
} Element;

void Random(int* A, int n) {

    srand((unsigned)time(NULL));
    for (int i = 0; i < n; i++)  {

        int dg = 200;
        int gg = 500;
        A[i] = dg + (float)rand() / RAND_MAX * (gg - dg);
    }
}

Element *createLinkedList(int *A, int n) {
    Element *head, *current;
    head = (Element*)malloc(sizeof(Element));
    current = head;
    for (int i = 0; i < n - 1; i++)
    {
        current->next = (Element*)malloc(sizeof(Element));
        current->value = A[i];
        current = current->next;
    }
    current->value = A[n];
    current->next = NULL;
    return head;
}

int sekvp_niza(int *v, int n, int x) {
    for (int i = 0; i < n; i++) {
        if (v[i] == x) {
            return i;
        }
    }
    return -1;
}

int sekv_pret_liste(Element *v, int x)
{
    Element *current;
    current = v;
    int i = 0;
    while (current != NULL){
        if (current->value == x)
            return i;
        current = current->next;
        i++;
    };
    return -1;
}

int main() {
    int *A;
    int n;
    printf("Unesi zeljeni broj elemenata:\n");
    scanf("%d", &n);
    Element *linkedList;
    time_t t1, t2, t3, t4, t5, t6;
    t1 = clock();
    A = (int*)malloc(n * sizeof(int));
    Random(A, n);
    t2 = clock();
    linkedList = createLinkedList(A, n);
    t3 = clock();
    printf("Vrijeme za kreiranje niza : %dms\n", t2 - t1);
    printf("Vrijeme za kreiranje popisa : %dms\n", t3 - t2);
    t4 = clock();
    int sekv = sekvp_niza(A, n, 2);
    t5 = clock();
    int lista = sekv_pret_liste(linkedList, 2);
    t6 = clock();
    printf("Vrijeme pretrazivanja niza : %dms\n", t5 - t4);
    printf("Vrijeme pretrazivanja liste : %dms\n", t6 - t5);

    return 0;
}