CetvrtiCas

#include <stdio.h>
#include <stdlib.h>
#include "math.h"
int linearnoTrazenje(int a[],int n, int el)
{
    int i;
    for (i=0;i<n;i++)
    {
        if (a[i]==el)
            return i;

    }
    return -1;
}

int binarnoTrazenje(int a[], int n, int el)
{
    int l=0,r=n-1;
    while(l<=r)
    {
        int mid=(l+r)/2;
        if (a[mid]==el)
            return mid;
        else if(a[mid]<el)
            l=mid+1;
        else r=mid-1;
    }
    return -1;
}

int sortiranje(int a[],int n)
{
    int i,j;
    for (i=0;i<n-1;i++)
    {
        for (j=i+1;j<n;j++)
        {
            if (a[i]>a[j])
            {
                int temp=a[i];
                a[i]=a[j];
                a[j]=temp;
            }
        }
    }
    return -1;
}

float f(float x)
{
    return (x-2)*(x-2)*(x-2);
}


float binTrazFunkcije(float l, float r)
{
    float mid=(l+r)/2;

    if(fabs(f(mid))<=0.00001)
    {
        return mid;
    }
    else if (f(mid)>0)
    {
        return binTrazFunkcije(l,mid);
    }
    else
        return binTrazFunkcije(mid,r);
}

int moze(int a, int k, int b, int m, int x,int d)
{
    return ((d-d/k)*a+(d-d/m)*b)>=x;
}


int drvosjece(int a, int k, int b, int m, int x,int l, int r)
{
    if(l>=r)
    {
    return r;
    }

    int d=(l+r)/2;
    if(moze(a,k,b,m,x,d))
    {
      return  drvosjece(a,k,b,m,x,l,d);
    }
    else
      return  drvosjece(a,k,b,m,x,d+1,r);
}




int main()
{

int mat [2][3]={{1,22,3},{4,8,34}};

int i,j;
for (i=0;i<2;i++)
{
    for (j=0;j<3;j++)
    {
        printf("%-4d",mat[i][j]);
    }
    printf("\n");
}

int a[7]={22,43,54,21,3,22,4000};

printf("%4d\n",linearnoTrazenje(a,7,44));

sortiranje(a,7);
printf("%d\n\n",binarnoTrazenje(a,7,54));

printf("%f\n", binTrazFunkcije(-3,4));

printf("%d\n", drvosjece(2,4,3,3,25,1,25+1));

    return 0;
}