//1.locatia de index 0

#include<iostream>
#include<limits.h>

int V[100];
int n;
using namespace std;

int main(){
    cout<<"n = ";cin>>n;
    for(int i=0;i<n;i++){
        cout<<"V["<<i<<"] = ";
        cin>>V[i];}
    for(int i=0;i<n-1;i++){
        int minim=INT_MAX;
        int top=0;
        for(int j=i;j<n;j++){
            if(V[j]<minim){
                minim=V[j];
                top=j;}}
        swap(V[i],V[top]);}
    cout<<endl<<"Sortate"<<endl;
    for(int i=0;i<n;i++){
        cout<<V[i]<<" ";}
    return 1;}
//2.descrescator

#include<iostream>
#include<limits.h>

int V[100];
int n;
using namespace std;

int main(){
    cout<<"n = ";cin>>n;
    for(int i=1;i<=n;i++){
        cout<<"V["<<i<<"] = ";
        cin>>V[i];}
    for(int i=1;i<n;i++){
        int minim=INT_MIN;
        int top=0;
        for(int j=i;j<=n;j++){
            if(V[j]>minim){
                minim=V[j];
                top=j;}}
        swap(V[i],V[top]);}
    cout<<endl<<"Sortate"<<endl;
    for(int i=1;i<=n;i++){
        cout<<V[i]<<" ";}
    return 1;}
//4.Parcurgerea NS de la coada spre inceput

#include<iostream>
#include<limits.h>

int V[100];
int n;
using namespace std;

int main(){
    cout<<"n = ";cin>>n;
    for(int i=1;i<=n;i++){
        cout<<"V["<<i<<"] = ";
        cin>>V[i];}
    for(int i=n;i>0;i--){
        int minim=INT_MIN;
        int top=0;
        for(int j=i;j>0;j--){
            if(V[j]>minim){
                minim=V[j];
                top=j;}}
        swap(V[i],V[top]);}
    cout<<endl<<"Sortate "<<endl;
    for(int i=1;i<=n;i++){
    cout<<V[i]<<" ";}
    return 1;}
//5.Parcurgere NS cu while in loc de for

#include<iostream>
#include<limits.h>

int V[100];
int n;
using namespace std;

int main(){
    cout<<"n = ";cin>>n;
    for(int i=1;i<=n;i++){
        cout<<"V["<<i<<"] = ";
        cin>>V[i];}
    int i=1;
    do{ int minim=INT_MAX;
        int top=0;
        for(int j=i;j<=n;j++){
            if(V[j]<minim){
                minim=V[j];
                top=j;}}
        swap(V[i],V[top]);
        i++;}while(i<n);
    cout<<endl<<"Sortate "<<endl;
    for(int i=1;i<=n;i++){
    cout<<V[i]<<" ";}
    return 1;}