Sunday, August 17, 2025

SWAP

 #include <iostream>

#include<bits/stdc++.h>
 using namespace std;
 void f(int i,int arr[],int n){
    if(i>=n/2)return;
    swap(arr[i],arr[n-i-1]);
    f(i+1,arr,n);
 }
 int main() {
 int n;
 cin>>n;
 int arr[n];
 for(int i=0;i<n;i++)cin>>arr[i];
 f(0,arr,n);
 return 0;
 }

No comments:

Post a Comment

MergeSort

  #include < iostream >   using namespace std ;   void merge ( vector < int >& n , int low , int mid , int high ){   ...