Scribd Logo
Upload

Welcome to Scribd!

  • 7 views

    Info

    Uploaded by

    alexia
    The document contains C++ code that: 1) Reads in an array of integers and finds the maximum and minimum values in the array. 2) Sorts the portion of the array between the maximum and minimum in descending order. 3) Outputs the sorted array.

    Copyright:

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

    You might also like

    Info

    Uploaded by

    alexia
    7 views4 pages
    The document contains C++ code that: 1) Reads in an array of integers and finds the maximum and minimum values in the array. 2) Sorts the portion of the array between the maximum and minimum in descending order. 3) Outputs the sorted array.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document contains C++ code that: 1) Reads in an array of integers and finds the maximum and minimum values in the array. 2) Sorts the portion of the array between the maximum and minimum in descending order. 3) Outputs the sorted array.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    7 views4 pages

    Info

    Uploaded by

    alexia
    The document contains C++ code that: 1) Reads in an array of integers and finds the maximum and minimum values in the array. 2) Sorts the portion of the array between the maximum and minimum in descending order. 3) Outputs the sorted array.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 4

    using namespace std;

    int v[1002],n,i,mn,mx,aux,j;

    int main()

    cin>>n;

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

    cin>>v[i];

    for(i=1;i<n;i++)

    if(v[i]>v[mx])

    mx=i;

    if(v[i]<v[mn])

    mn=i;

    if(mn>mx)

    {aux=mn;

    mn=mx;

    mx=aux;}

    for(i=mn;i<=mx;i++)

    for(j=i+1;j<=mx;j++)

    if(v[i]>v[j])

    aux=v[i];

    v[i]=v[j];

    v[j]=aux;

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

    cout<<v[i]<<" ";

    return 0;
    #include <iostream>

    using namespace std;

    int n, v[1001], a[1001], i, k, j, aux;

    int main(){

    cin >> n;

    for(i = 1; i <= n; i++){

    cin >> v[i];

    if(v[i] % 10 == 0){

    a[k] = v[i];

    k++;

    for(i = 0; i <= k; i++){

    for(j = i; j <= k; j++)

    if(a[i] < a[j]){

    aux = a[j];

    a[j] = a[i];

    a[i] = aux;

    for(i = 0; i < k; i++)

    cout << a[i] <<' ';

    return 0;

    }
    #include <iostream>

    using namespace std;

    int v[1001],n,j,i,aux,baux,mx=0,mxb;

    int main()

    cin>>n;

    for(i=1;i<=n;i++)

    cin>>v[i];

    for(i=1;i<=n;i++)

    if(v[i]>mx)

    mx=v[i];

    mxb=i;

    for(i=1;i<=mxb;i++)

    for(j=i+1;j<=mxb;j++)

    if(v[i]>v[j])

    aux=v[i];

    v[i]=v[j];

    v[j]=aux;

    for(i=mxb+1;i<=n;i++)

    for(j=i+1;j<=n;j++)

    if(v[i]<v[j])

    baux=v[j];
    v[j]=v[i];

    v[i]=baux;

    for(i=1;i<=n;i++)

    cout<<v[i]<<“ “;

    return 0;

    You might also like