Take n no. Of elements and arrange them in Ascending & Descending Order

Que. Take n no. Of elements and arrange them in Ascending & Descending Order 

•  Code:-

#include<iostream>
//or
#include<bits/stdc++.h>
//^ this one is awesome for doing all kind of stuff in c++ and also you dont have to include any other header file ,if you enter this one 
using namespace std;
int main (){
    int n ;
    cout<<"write size of array:";
    cin>>n;
    int arr[n];
    for(int i =0, j=1;i<n,j<n+1;i++,j++){
        cout<<"enter "<<j<<"th location value: ";
        cin>>arr[i];
        cout<<" ";
    }
   
    
    //program for arranging in ascending order using for loop
     for(int j=0;j<n;j++){
        for(int i=0;i<n;i++){
            if(arr[i]>arr[i+1]){
                int temp= arr[i];
                arr[i]= arr[i+1];
                arr[i+1]=temp;
            }
        }
    }
     cout<<" givn elements can be arranged in ascending order  as ";
    for (int i=0;i<n;i++){
       cout<<arr[i]<<" ";
    }
    cout<<endl;
//program for arranging in descending order using while loop
   int go =1;
    while(go<n-1){
        for(int i=0;i<n-go;i++){
            if(arr[i+1]>arr[i]){
                int temp= arr[i];
                arr[i]= arr[i+1];
                arr[i+1]=temp;
            }
            if(arr[0]<arr[i]){
                    int h = arr[0];
                arr[0]=arr[i];
                arr[i]= h;
            }
        }
        go++;
    }
     cout<<" givn elements can be arranged in descending order  as ";
    for (int i=0;i<n;i++){
       cout<<arr[i]<<" ";
    }
    cout<<endl;
    return 0;
}

Output:-