Using Divide And Conqure Technique finding maximum and minimum value of an array

Language C++

/************
done!
************/
#include<bits/stdc++.h>

using namespace std;

int a[1000];

void DAndCMaxMin(int i,int j,int &maxx,int &minx)
{
    int min1,max1;

    if(i==j){/**smallp*/

    maxx=a[i];

    minx=a[i];

    return;

    }

    if( i==j-1 )/**smallp*/

    {

        if(a[i]<a[j]){

            maxx=a[j];

            minx=a[i];

        }

        else

        {

            maxx=a[i];

            minx=a[j];

        }

        return;

    }

    else

    {

        int mid=(i+j)/2;

        /************

        dividing part

        ************/

        DAndCMaxMin(i,mid,maxx,minx);

        DAndCMaxMin(mid+1,j,max1,min1);

        /*************

        combining part

        *************/

        if(maxx<max1)

            maxx=max1;

        if(minx>min1)

            minx=min1;

    }
}

int main()

{

    int n;

    while(cin>>n)

    {

        int maxx=0,minx=0;

        for(int i=0;i<n;i++)
            cin>>a[i];

        DAndCMaxMin(0,n-1,maxx,minx);

        cout<<"Maximum value is "<<maxx<<endl;

        cout<<"Minimum value is "<<minx<<endl;

    }
    return 0;
}

Java:Sorting an array

//This program will take some random values and sort them in ascending order

import static java.lang.Math.abs;
import java.util.*;

public class SortingAnArray {

    public static void main(String[] args) {

        Scanner obj=new Scanner(System.in);
        int n;
        n=obj.nextInt();
        int a[]=new int[n];
        Random ob=new Random();
        for(int i=0;i<n;i++)
        {
            a[i]=ob.nextInt()%9;
            if(a[i]<0)
                a[i]=abs(a[i]);
        }
        System.out.println("Elements before sorting");
        for(int i:a)
        {
            System.out.printf("%d ",i);
        }
        System.out.println();
        Arrays.sort(a);
        System.out.println("Elements after sorting");
        for(int i:a)
        {
            System.out.printf("%d ",i);
        }
        System.out.println();
    }
   
}