Scribd Logo
Upload

Welcome to Scribd!

  • MC Programming

    Uploaded by

    Antonio Juárez Alonso
    9 views6 pages
    The document contains code for several algorithms: 1. A recursive function that calculates the factorial of a number. 2. A program that finds the largest three elements in an array. 3. A recursive linear search function to search for an element in an array. 4. Code that merges two sorted arrays into a single sorted array.

    Original Description:

    Original Title

    mc programming

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document contains code for several algorithms: 1. A recursive function that calculates the factorial of a number. 2. A program that finds the largest three elements in an array. 3. A recursive linear search function to search for an element in an array. 4. Code that merges two sorted arrays into a single sorted array.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    9 views6 pages

    MC Programming

    Uploaded by

    Antonio Juárez Alonso
    The document contains code for several algorithms: 1. A recursive function that calculates the factorial of a number. 2. A program that finds the largest three elements in an array. 3. A recursive linear search function to search for an element in an array. 4. Code that merges two sorted arrays into a single sorted array.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 6

    Advanced programming; ANTONIO JUÁREZ ALONSO 1942584

    #include<iostream>
    using namespace std;

    int A, N;

    int fnA(int A, int N)


    {
    if (N>0)
    {
    return A*N + fnA(A+1, N-1);
    }
    else
    {
    return 0;
    }
    }

    int main()
    {
    cin>>A>>N;
    cout<<fnA(A, N);
    }
    Advanced programming; ANTONIO JUÁREZ ALONSO 1942584

    #include<iostream>
    using namespace std;

    int main ()
    {
    int N;
    cin>>N;
    int A[N];
    int first=-1, second=-1, third=-1;
    for(int i=0; i<N; i++)
    {
    cin>>A[i];
    if(A[i]>first)
    {
    third = second;
    second = first;
    first = A[i];
    }
    else
    {
    if(A[i]>second)
    {
    third = second;
    second = A[i];
    }
    else
    Advanced programming; ANTONIO JUÁREZ ALONSO 1942584

    {
    if(A[i]>third)
    {
    third = A[i];
    }
    }
    }
    }
    cout<<first<<"-"<<second<<"-"<<third;
    }
    Advanced programming; ANTONIO JUÁREZ ALONSO 1942584

    #include<iostream>
    using namespace std;

    bool recursive_lineal_search(int *A, int N, int e)


    {
    if ( N==0 )
    {
    return false;
    }
    else
    {
    if ( *A==e )
    {
    return true;
    }
    else
    {
    return recursive_lineal_search( A , N-1 , e);
    }
    }

    int main()
    {
    Advanced programming; ANTONIO JUÁREZ ALONSO 1942584

    #include<iostream>
    using namespace std;

    void JOINT();
    int N, M, j, k, i, K;
    int main()
    {
    cin>>N;
    int A[N];
    for(int i=0; i<N; i++)
    {
    cin>>A[i];
    }
    cin>>M;
    int B[M];
    for(int j=0; j<M; j++)
    {
    cin>>B[j];
    }

    int C[k];
    int i=0, j=0, k=0;

    for( ; i<N&&j<M; k++)


    Advanced programming; ANTONIO JUÁREZ ALONSO 1942584

    {
    if(A[i]<B[j])
    {
    C[k]=A[i++];
    }
    else
    {
    C[k]=B[j++];
    }
    }
    while(i<N)
    {
    C[k++]=A[i++];
    }
    while(j<M)
    {
    C[k++]=B[j++];
    }
    K=M+N;
    for (k=0; k<K; k++)
    {
    cout<<C[k]<<"-";
    }
    }

    You might also like