C :

#include <stdio.h>
void main() 
{ 
int i,j,n,a[100000],t;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=1;i<n;i++)
for(j=0;j<n-i;j++)
if(a[j]>a[j+1])
{
	t=a[j];
	a[j]=a[j+1];
	a[j+1]=t;
}
printf("%d %d\n",a[n-1],a[0]);
}

C++ :

#include<iostream>
using namespace std;
int main()
{
	int n,x,max,min;
	cin>>n;
	max=0; min=10000;
	for (int i=0;i<n;i++)
	{
		cin>>x;
		if (x>max) max=x;
		if (x<min) min=x;		
	}
	cout<<max<<" "<<min<<endl;
	//system("pause");
	return 0;
}

Pascal :

var a:array[1..10] of longint;
  max,min,i,n:longint;

begin
   readln(n);
   max:=-maxint;min:=maxint;
   for i:=1 to n do
      begin
       read(a[i]);
       if a[i]>max then max:=a[i];
       if a[i]<min then min:=a[i];
      end;
   writeln(max,' ',min);
  end.

Java :

import java.util.Arrays;
import java.util.Scanner;

public class Main {
  private static Scanner s = new Scanner(System.in) ;
  public static void main(String[] args) {
	int num = s.nextInt() ;
	long a[] = new long[num] ;
	for (int i = 0; i < num; i++) {
		a[i] = s.nextLong() ;
	}
	Arrays.sort(a);
	System.out.print(a[a.length-1]+" ");
	System.out.println(a[0]);
  }
}

Python :

input()
b = [int(c) for c in raw_input().split(" ")]
print "%d %d" % (max(b), min(b))