9.11.2017 LAB

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

int cautareBinara(int v[100], int x, int l, int r)
{
    int mij = l + (r-l)/2;

    while ( l <= r)
    {
        if ( x == v[mij] )
            return mij;

        if ( x < v[mij] )
            r = mij +1;
        else
            l = mij -1;

        mij = l + (r-l)/2;
    }
}

void cautareBinara2()
{
    int v[10]={1,2,3,4,5,6,7,8,9,10}; // 10 elem

    int i, x,y, indx,indy;

    printf("Citi x si y. Sa se gaseasca in vector (x < y). \n");
    scanf("%d %d", &x, &y); // sa se gaseasca in numerele din vector

    indx = cautareBinara(v,x,0,9);
    indy = cautareBinara(v,y,0,9);

    printf("\n");

    for (i = indx + 1; i < indy; i++)
        printf("%d ", v[i]);
}

void transpusa()
{
    int a[100][100], b[100][100];
    int i,j,n;

    printf("Cititi dimensiunea matricei si apoi elementele matricei. \n");
    scanf("%d", &n);

    printf("\n");

    for (i=0; i<n; i++)
        for (j=0; j<n; j++)
        {
            printf("a[%d][%d] = ", i,j);
            scanf("%d", &a[i][j]);
        }

    for (i=0; i<n; i++)
        for (j=0; j<n; j++)
            b[i][j]=a[j][i];


     printf("\n Matricea normala este: \n");

    for (i=0; i<n; i++)
    { for (j=0; j<n; j++)
        printf("%d ", a[i][j]);
        printf("\n");
    }


    printf("\n Matricea transpusa este: \n");

    for (i=0; i<n; i++)
    { for (j=0; j<n; j++)
        printf("%d ", b[i][j]);
        printf("\n");
    }

}


void spirala(int n, int m)
{
    int a[100][100];
    int i,j, el=1;

    for (i=0; i<n; i++) // construirea matricii
        for (j=0; j<m; j++)
        {
            a[i][j] = el;
            el++;
        }

    int c = 0, k = 0;

    while (c != n * m)
        {
        for (j= 0 + k; j < m - k; j++)
            { printf("%d ", a[0 + k][j]); c++;

              if (c == n*m)
                return;
            }

        for (i= 1 + k; i < n - k; i++)
            { printf("%d ", a[i][m - (1+k)]); c++;

            if (c == n*m)
                return;
            }

        for (j= m - (2+k); j >= 0 + k; j--)
            { printf("%d ", a[n - (1+k)][j]); c++;

            if (c == n*m)
                return;
            }

        for (i= n - (2+k); i > 0 + k ; i--)
            { printf("%d ", a[i][0 + k]); c++;

            if (c == n*m)
                return;
            }

            k++;
        }
}


int main()
{

    spirala(4,4);

    return 0;
}