Язык Си. Сортировка и поиск элементов массива

 #include "stdio.h"

 



 

void printArray(const int *arr, int N){

 

    for(int i = 0; i < N; i++)

 

        printf("%d ", *(arr + i));

 

}

 



 

void swap(int *a, int *b){

 

    int t = *a;

 

    *a = *b;

 

    *b = t;

 

}

 



 

void bubbleSort(const int *arr, int N){

 

    for(int i = 0; i < N; i++)

 

        for(int j = 0; j < N - i - 1; j++)

 

            if(*(arr + j) > *(arr + j + 1))

 

                swap(&(*(arr + j)), &(*(arr + j + 1)));

 

}

 



 

int binSearch(const int *arr, int N, int val){

 

    int l = 0, r = N - 1;

 

    while(l  val)

 

            r = mid - 1;

 

        else if(*(arr + mid) < val)

 

            l = mid + 1;

 

        else

 

            return mid;

 

    }

 

    return -1;

 

}

 



 

int main(){

 

    int n, x;

 

    printf("Input size of the array:\n");

 

    scanf("%d", &n);

 

    int a[n];

 

    printf("Input elements of the array:\n");

 

    for(int i = 0; i < n; i++)

 

        scanf("%d", &a[i]);

 

    printf("Initial array:\n");

 

    printArray(a, n);

 

    bubbleSort(a, n);

 

    printf("\nSorted array:\n");

 

    printArray(a, n);

 

    printf("\nInput value is needed to be found:\n");

 

    scanf("%d", &x);

 

    int index = binSearch(a, n, x);

 

    if(index < 0)

 

        printf("There is no such an element in the array");

 

    else

 

        printf("Element has been found. It is at the position # %d in the sorted array", index);

 

}