Advertisement
marius7122

Untitled

Jul 14th, 2019
146
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.73 KB | None | 0 0
  1. #include <iostream>
  2.  
  3. using namespace std;
  4.  
  5. int v[100], n, i, j, indiceMinim;
  6.  
  7. int main()
  8. {
  9.     // citire
  10.     cout<<"n = "; cin>>n;
  11.     for(i=0;i<n;i++)
  12.     {
  13.         cout<<"v["<<i<<"] = ";cin>>v[i];
  14.     }
  15.  
  16.  
  17.     // sortare
  18.     for(i=0;i<n;i++)
  19.     {
  20.         // cautam minimul dintre v[i], v[i+1] ... v[n-1]
  21.         indiceMinim = i;
  22.         for(j=i+1; j<n; j++)
  23.             if(v[j] < v[indiceMinim])
  24.                 indiceMinim = j;
  25.  
  26.         // inversam valoarea de pe pozitia i cu valoarea minima gasita
  27.         int aux = v[i];
  28.         v[i] = v[indiceMinim];
  29.         v[indiceMinim] = aux;
  30.     }
  31.  
  32.     // afisare
  33.     cout<<"Vectorul sortat:"<<endl;
  34.     for(i=0;i<n;i++)
  35.         cout<<v[i]<<' ';
  36.  
  37.     return 0;
  38. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement