C :

#include <stdio.h>
int main(){
    int n, m, i, t, max, min;
    scanf("%d",&n);
    while(n--){
        scanf("%d",&m);
        scanf("%d", &t);
        max=min=t;
        for(i = 1; i < m; i++){
            scanf("%d", &t);
            if(max < t) max = t;
            if(min > t) min = t;
        }
        printf("%d %d\n", min, max);
    }
    return 0;
}

C++ :

#include<iostream>
using namespace std;
int main(){
	int n,a[100];
	cin>>n;
	while(n--){
		int m,max,min;
		cin>>m;
		for(int i=0;i<m;i++)
			cin>>a[i];
		max=min=a[0];
		for(int j=1;j<m;j++){
			if(a[j]<min)
				min=a[j];
			if(a[j]>max)
				max=a[j];
		}
		cout<<min<<" "<<max<<endl;
	}
}

Java :

import java.util.Scanner;
public class Main
{
	public static void main(String[] args)
	{
		Scanner sc=new Scanner(System.in);
		int T=sc.nextInt();
		while(T-->0)
		{
			int n=sc.nextInt();
			int arr[]=new int[n];
			for(int i=0;i<n;i++)
			{
				arr[i]=sc.nextInt();
			}
			insertSort(arr);
			System.out.println(arr[0]+" "+arr[n-1]);
		}
	}
	public static void insertSort(int arr[])
	{
	    for (int i = 1; i < arr.length; i++)
	    {
	        if (arr[i - 1] > arr[i])
	        {
	            int temp = arr[i];
	            int j = i;
	            while (j > 0 && arr[j - 1] > temp)
	            {
	                arr[j] = arr[j - 1];
	                j--;
	            }
	            arr[j] = temp;
	        }
	    }
	}
}