Scribd Logo
Importer

Bienvenue sur Scribd !

  • WWW - Referat.ro Vectori60ec483

    Transféré par

    andronache_costin
    22 vues3 pages
    The document discusses two sorting algorithms that work with vectors: 1. Sorting by finding the minimum, where the algorithm iterates through the vector, finds the minimum element, and swaps it with the current element. 2. Bubble sort, where the algorithm repeats iterating through the vector, swapping adjacent elements that are out of order until the vector is fully sorted.

    Description originale:

    Titre original

    Www.referat.ro Vectori60ec483

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Formats disponibles

    DOC, PDF, TXT ou lisez en ligne sur Scribd

    Avez-vous trouvé ce document utile ?

    Ce contenu est-il inapproprié ?

    Signaler ce document
    The document discusses two sorting algorithms that work with vectors: 1. Sorting by finding the minimum, where the algorithm iterates through the vector, finds the minimum element, and swaps it with the current element. 2. Bubble sort, where the algorithm repeats iterating through the vector, swapping adjacent elements that are out of order until the vector is fully sorted.

    Droits d'auteur :

    Attribution Non-Commercial (BY-NC)
    Téléchargez comme DOC, PDF, TXT ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    22 vues3 pages

    WWW - Referat.ro Vectori60ec483

    Transféré par

    andronache_costin
    The document discusses two sorting algorithms that work with vectors: 1. Sorting by finding the minimum, where the algorithm iterates through the vector, finds the minimum element, and swaps it with the current element. 2. Bubble sort, where the algorithm repeats iterating through the vector, swapping adjacent elements that are out of order until the vector is fully sorted.

    Droits d'auteur :

    Attribution Non-Commercial (BY-NC)
    Téléchargez comme DOC, PDF, TXT ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    sur 3

    ALGORITMI FUNDAMENTALI CARE

    LUCREAZA CU VECTORI
    METODE DE SORTARE

    Operatia prin care se aranjeaza cele n numere intr-o ordine(crescatoare sau descrescatoare) se numeste
    sortare.

    A.program sort_min;
    type numere=array[1..100]of integer;
    var a:numere;
    n,i,j,k,man,min:integer;
    begin
    write('n:=');readln(n);
    for i:=1 to n do begin
    write('a[',i,']:=');readln(a[i]);
    end;
    for i:=1 to n-1 do begin
    min:=a[i];
    k:=i;
    for j:=i+1 to n do
    if a[j]<min then begin
    min:=a[j];
    k:=j;
    end;
    man:=a[k];
    a[k]:=a[i];
    a[i]:=man;
    end;
    for i:=1 to n do writeln(a[i],' ');
    readln;
    end.

    B.Sortarea prin interschimbare(sortare clasica,metoda BULELOR)


    program sort_interschimb;
    type numere=array[1..100]of integer;
    var a:numere;
    n,i,man:integer;
    gasit:boolean;
    begin
    write('n:=');readln(n);
    for i:=1 to n do begin
    write('a[',i,']:=');readln(a[i]);
    end;
    repeat
    gasit:=false;
    for i:=1 to n-1 do
    if a[i]>a[i+1] then begin
    gasit:=true;
    man:=a[i];
    a[i]:=a[i+1];
    a[i+1]:=man;
    end;
    until not gasit;
    for i:=1 to n do write(a[i],' ');
    readln;
    end.

    Powered by http://www.referat.ro/
    cel mai tare site cu referate

    Vous aimerez peut-être aussi