Scribd Logo
Upload

Welcome to Scribd!

  • Alg. Si Str. de Date

    Uploaded by

    Carnat
    7 views2 pages
    The document contains code to sort arrays in C++ using two different sorting algorithms: direct insertion sort and selection sort. Direct insertion sort iterates through the array and inserts each element into the sorted portion, while selection sort finds the minimum element in the unsorted portion and swaps it with the current element. Both algorithms sort the input array in place without using additional storage.

    Original Description:

    Original Title

    Alg. si str. de date.txt

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document contains code to sort arrays in C++ using two different sorting algorithms: direct insertion sort and selection sort. Direct insertion sort iterates through the array and inserts each element into the sorted portion, while selection sort finds the minimum element in the unsorted portion and swaps it with the current element. Both algorithms sort the input array in place without using additional storage.

    Copyright:

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

    Alg. Si Str. de Date

    Uploaded by

    Carnat
    The document contains code to sort arrays in C++ using two different sorting algorithms: direct insertion sort and selection sort. Direct insertion sort iterates through the array and inserts each element into the sorted portion, while selection sort finds the minimum element in the unsorted portion and swaps it with the current element. Both algorithms sort the input array in place without using additional storage.

    Copyright:

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

    #include <iostream>

    using namespace std;


    int main()
    {
    int a[100],n,i,j,key;
    cout<<"n=";
    cin>>n;
    cout<<"Sirul este ";
    for(i=0;i<n;i++)
    cin>>a[i];

    for(j=1;j<n;j++)
    {
    key=a[j];
    i=j-1;
    while(i>=0&&a[i]>key)
    {
    a[i+1]=a[i];
    i=i-1;
    }
    a[i+1]=key;
    }
    for(i=0;i<n;i++)
    cout<<a[i]<<" ";
    return 0;
    }

    SORTAR PRIN INTERSCHIMBARE DIRECTA

    #include <iostream>
    using namespace std;
    int main()
    {
    int a[100],n,i,j,schimbare;
    cout<<"n=";
    cin>>n;
    cout<<"Sirul este:"<<endl;
    for(i=0;i<n;i++)
    cin>>a[i];

    for(i=0;i<n-1;i++)
    {
    for(j=i+1;j<n;j++)
    {
    if(a[i]> a[j])
    {
    schimbare=a[i];
    a[i]=a[j];
    a[j]=schimbare;
    }

    }
    }
    for(i=0;i<n;i++)
    cout<<a[i]<<" ";
    return 0;
    }

    SORTARE PRIN INTERSCHIMBARE DIRECTA


    SAU SELECTIE?

    You might also like