C :

#include<stdio.h>

void main(){
    int n,i,t,max=0,min=0;
    int a[1000];
    scanf("%d",&n);

    for(i=0;i<n;i++){
        scanf("%d",&a[i]);
    }

    for(i=1;i<n;i++){
        if(a[i]<a[min]){
            min=i;
        }
        if(a[i]>a[max]){
            max=i;
        }
    }
    
    t=a[min];
    a[min]=a[max];
    a[max]=t;
    
    for(i=0;i<n;i++){
        printf("%d ",a[i]);
    }
}

C++ :

#include <iostream>
#include <iomanip>

using namespace std;

int main(){
	int a[100],i,j,max,min,t,n;
	cin>>n;
	for(i = 0;i < n;i++){
		cin>>a[i];
	}
	
	max = 0;
	min = 0;
	for(i = 1;i < n;i++){
		if(a[i] > a[max]){
			max = i;
		}
		
		if(a[i] < a[min]){
			min = i;
		}
	}
	
	t = a[max];
	a[max] = a[min];
	a[min] = t;
	
	for(i = 0;i < n;i++){
		cout<<a[i]<<" ";
	}
}

Pascal :

var a:array[1..100000] of longint;
max,min,b,i,j:longint;
begin
read(b);
for i:=1 to b do
read(a[i]);
for i:=1 to b do
if a[i]>max then max:=a[i];
min:=1000;
for i:=1 to b do
if a[i]<min then min:=a[i];
for i:=1 to b do
if a[i]=max then write(min,' ')
else if a[i]=min then write(max,' ')
else
write(a[i],' ');
end.

Java :

import java.util.Scanner;

public class Main{
	public static void main(String[] args){	

    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int a[] = new int[n];
    for(int i=0;i< a.length;i++) {
    a[i] = sc.nextInt();
    }
    int max = a[0],min = a[0];
    int x = 0 , y = 0;
    for(int i=0;i<a.length;i++) {
    if(max < a[i]) {
    max = a[i];
    x = i;
    }
    if(min > a[i]) {
    min = a[i];
    y = i;
    }
    }

    int t = a[x];
    a[x] = a[y];
    a[y] = t;

    for(int i=0 ; i<a.length ; i++) {
    System.out.println(a[i]);
    }
  
}
}

Python :

n=int(input())
m=list(map(int,input().split()))
a=m.index(max(m))
b=m.index(min(m))
m[a],m[b]=m[b],m[a]
for item in m:
    print(item,end=" ")