Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <iostream>
- using namespace std;
- int v[50];
- int n;
- void selectSort()
- {
- int min, aux;
- int i=0, j;
- pas1:
- if(i==n)
- goto endPas1;
- min = i;
- j=i+1;
- pas2:
- if(j==n)
- goto endPas2;
- if(v[j] < v[min])
- min=j;
- j++;
- goto pas2;
- endPas2:
- //fac swap
- if(min != i)
- {
- aux = v[i];
- v[i] = v[min];
- v[min] = aux;
- }
- i++;
- goto pas1;
- endPas1:
- ;
- }
- int main()
- {
- int i=0;
- printf("Introdu dimensiune vector: ");
- cin>>n;
- add:
- cin>>v[i];
- i++;
- if(i<n)
- goto add;
- selectSort();
- i=0;
- pas1:
- cout<<v[i]<<" ";
- i++;
- if(i<n)
- goto pas1;
- cout<<endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement