Verification: a143cc29221c9be0

Oi maxus lan operator list php

C++

#include

using namespace std;

void maxProduct(int arr[], int n)

{

    if (n

    {

        cout "No pairs exists\n";

        return;

    }

    int a = arr[0], b = arr[1];

    for (int i=0; i

      for (int j=i+1; j

         if (arr[i]*arr[j] > a*b)

            a = arr[i], b = arr[j];

    cout "Max product pair is {" ", "

         "}";

}

int main()

{

    int arr[] = {1, 4, 3, 6, 7, 0};

    int n = sizeof(arr)/sizeof(arr[0]);

    maxProduct(arr, n);

    return 0;

}

Java

import java.util.*;

class GFG {

    static void maxProduct(int arr[], int n)

    {

        if (n 2)

        {

            System.out.println("No pairs exists");

            return;

        }

        int a = arr[0], b = arr[1];

        for (int i = 0; i

          for (int j = i + 1; j

             if (arr[i] * arr[j] > a * b){

                a = arr[i];

                b = arr[j];

             }

        System.out.println("Max product pair is {" +

                           a + ", " + b + "}");

    }

    public static void main(String[] args)

    {

        int arr[] = {1, 4, 3, 6, 7, 0};

        int n = arr.length;

        maxProduct(arr, n);

    }

}

Python3

def maxProduct(arr, n):

    if (n 2):

        print("No pairs exists")

        return

    a = arr[0]; b = arr[1]

    for i in range(0, n):

        for j in range(i + 1, n):

            if (arr[i] * arr[j] > a * b):

                a = arr[i]; b = arr[j]

    print("Max product pair is {", a, ",", b, "}",

                                          sep = "")

arr = [1, 4, 3, 6, 7, 0]

n = len(arr)

maxProduct(arr, n)

C#

using System;

class GFG

{

    static void maxProduct(int []arr, int n)

    {

        if (n

        {

            Console.Write("No pairs exists");

            return;

        }

        int a = arr[0], b = arr[1];

        for (int i = 0; i

        for (int j = i + 1; j

            if (arr[i] * arr[j] > a * b)

            {

                a = arr[i];

                b = arr[j];

            }

    Console.Write("Max product pair is {" +

                       a + ", " + b + "}");

    }

    public static void Main()

    {

        int []arr = {1, 4, 3, 6, 7, 0};

        int n = arr.Length;

        maxProduct(arr, n);

    }

}

PHP

function maxProduct( $arr, $n)

{

    if ($n

    {

        echo "No pairs exists\n";

        return;

    }

    $a = $arr[0];

    $b = $arr[1];

    for ($i = 0; $i $n; $i++)

    for ($j = $i + 1; $j $n; $j++)

    {

        if ($arr[$i] * $arr[$j] > $a * $b)

        {

            $a = $arr[$i];

            $b = $arr[$j];

        }

    }

    echo "Max product pair is {" , $a , ", ";

    echo $b , "}";

}

    $arr = array(1, 4, 3, 6, 7, 0);

    $n = count($arr);

    maxProduct($arr, $n);

?>

Javascript

function maxProduct(arr, n)

{

    if (n

    {

        document.write("No pairs exists" + "
"
);

        return;

    }

    let a = arr[0], b = arr[1];

    for (let i=0; i

    for (let j=i+1; j

        if (arr[i]*arr[j] > a*b)

            a = arr[i], b = arr[j];

    document.write("Max product pair is {" + a + ", "

        + b + "}");

}

    let arr = [1, 4, 3, 6, 7, 0];

    let n = arr.length;

    maxProduct(arr, n);

C++14

#include

using namespace std; 

void maxProduct(vectorint>arr, int n)

{

    sort(arr.begin(), arr.end());

    int num1, num2;

    int sum1 = arr[0] * arr[1];

    int sum2 = arr[n - 1] * arr[n - 2];

    if (sum1 > sum2)

    {

        num1 = arr[0];

        num2 = arr[1];

    }

    else

    {

        num1 = arr[n - 2];

        num2 = arr[n - 1];

    }

    cout "Max product pair = ")

         ","

}

int  main()

{

    vectorint>arr = { 1, 4, 3, 6, 7, 0 };

    int n = arr.size();

    maxProduct(arr, n);

}

Java

import java.util.*;

public class GFG {

    static void maxProduct(int arr[], int n)

    {

        Arrays.sort(arr);

        int num1, num2;

        int sum1 = arr[0] * arr[1];

        int sum2 = arr[n - 1] * arr[n - 2];

        if (sum1 > sum2) {

            num1 = arr[0];

            num2 = arr[1];

        }

        else {

            num1 = arr[n - 2];

            num2 = arr[n - 1];

        }

        System.out.println("Max product pair = " +

                           "{" + num1 + "," + num2 + "}");

    }

    public static void main(String[] args)

    {

        int arr[] = { 1, 4, 3, 6, 7, 0 };

        int n = arr.length;

        maxProduct(arr, n);

    }

}

Python3

def maxProduct(arr, n):

    arr.sort()

    num1 = num2 = 0

    sum1 = arr[0] * arr[1]

    sum2 = arr[n - 1] * arr[n - 2]

    if (sum1 > sum2):

        num1 = arr[0]

        num2 = arr[1]

    else:

        num1 = arr[n - 2]

        num2 = arr[n - 1]

    print("Max product pair = {", num1, ",", num2, "}", sep="")

arr = [1, 4, 3, 6, 7, 0]

n = len(arr)

maxProduct(arr, n)

C#

using System;

class GFG{

static void maxProduct(int []arr, int n)

{

    Array.Sort(arr);

    int num1, num2;

    int sum1 = arr[0] * arr[1];

    int sum2 = arr[n - 1] * arr[n - 2];

    if (sum1 > sum2)

    {

        num1 = arr[0];

        num2 = arr[1];

    }

    else

    {

        num1 = arr[n - 2];

        num2 = arr[n - 1];

    }

    Console.Write("Max product pair = " +

                  "{" + num1 + "," + num2 + "}");

}

public static void Main(String[] args)

{

    int []arr = { 1, 4, 3, 6, 7, 0 };

    int n = arr.Length;

    maxProduct(arr, n);

}

}

Javascript

function maxProduct(arr, n)

{

    arr.sort(function(a, b){return a - b});

    let  num1, num2;

    let sum1 = arr[0] * arr[1];

    let sum2 = arr[n - 1] * arr[n - 2];

    if (sum1 > sum2)

    {

        num1 = arr[0];

        num2 = arr[1];

    }

    else

    {

        num1 = arr[n - 2];

        num2 = arr[n - 1];

    }

    document.write("Max product pair = " +

                 "{" + num1 + "," + num2 + "}");

}

let arr = [ 1, 4, 3, 6, 7, 0 ];

let n = arr.length;

maxProduct(arr, n);

C++

#include

using namespace std;

void maxProduct(int arr[], int n)

{

    if (n

    {

        cout "No pairs exists\n";

        return;

    }

    if (n == 2)

    {

        cout " "

        return;

    }

    int posa = INT_MIN, posb = INT_MIN;

    int nega = INT_MIN, negb = INT_MIN;

    for (int i = 0; i

    {

        if (arr[i] > posa)

        {

            posb = posa;

            posa = arr[i];

        }

        else if (arr[i] > posb)

            posb = arr[i];

        if (arr[i] abs(arr[i]) > abs(nega))

        {

            negb = nega;

            nega = arr[i];

        }

        else if(arr[i] abs(arr[i]) > abs(negb))

            negb = arr[i];

    }

    if (nega*negb > posa*posb)

        cout "Max product pair is {" ", "

             "}";

    else

        cout "Max product pair is {" ", "

             "}";

}

int main()

{

    int arr[] = {1, 4, 3, 6, 7, 0};

    int n = sizeof(arr)/sizeof(arr[0]);

    maxProduct(arr, n);

    return 0;

}

Java

import java.util.*;

class GFG {

    static void maxProduct(int arr[], int n)

    {

        if (n 2)

        {

            System.out.println("No pairs exists");

            return;

        }

        if (n == 2)

        {

            System.out.println(arr[0] + " " + arr[1]);

            return;

        }

        int posa = Integer.MIN_VALUE,

            posb = Integer.MIN_VALUE;

        int nega = Integer.MIN_VALUE,

            negb = Integer.MIN_VALUE;

        for (int i = 0; i

        {

            if (arr[i] > posa)

            {

                posb = posa;

                posa = arr[i];

            }

            else if (arr[i] > posb)

                posb = arr[i];

            if (arr[i] 0 && Math.abs(arr[i]) >

                       Math.abs(nega))

            {

                negb = nega;

                nega = arr[i];

            }

            else if(arr[i] 0 && Math.abs(arr[i])

                       > Math.abs(negb))

                negb = arr[i];

        }

        if (nega * negb > posa * posb)

            System.out.println("Max product pair is {"

                          + nega + ", " + negb + "}");

        else

            System.out.println("Max product pair is {"

                          + posa + ", " + posb + "}");

    }

    public static void main(String[] args)

    {

        int arr[] = {1, 4, 3, 6, 7, 0};

        int n = arr.length;

        maxProduct(arr, n);

    }

}

Python3

def maxProduct(arr, n):

    if (n 2):

        print("No pairs exists")

        return

    if (n == 2):

        print(arr[0] ," " , arr[1])

        return

    posa = 0

    posb = 0

    nega = 0

    negb = 0

    for i in range(n):

        if (arr[i] > posa):

            posb = posa

            posa = arr[i]

        elif (arr[i] > posb):

            posb = arr[i]

        if (arr[i] 0 and abs(arr[i]) > abs(nega)):

            negb = nega

            nega = arr[i]

        elif(arr[i] 0 and abs(arr[i]) > abs(negb)):

            negb = arr[i]

    if (nega * negb > posa * posb):

        print("Max product pair is {" ,

                nega ,", ", negb , "}")

    else:

        print( "Max product pair is {" ,

                 posa ,", " ,posb , "}")

if __name__ =="__main__":

    arr = [1, 4, 3, 6, 7, 0]

    n = len(arr)

    maxProduct(arr, n)

C#

using System;

class GFG {

    static void maxProduct(int []arr, int n)

    {

        if (n

        {

            Console.WriteLine("No pairs exists");

            return;

        }

        if (n == 2)

        {

            Console.WriteLine(arr[0] + " " + arr[1]);

            return;

        }

        int posa = int.MinValue;

        int posb = int.MaxValue;

        int nega = int.MinValue;

        int negb = int.MaxValue;

        for (int i = 0; i

        {

            if (arr[i] > posa)

            {

                posb = posa;

                posa = arr[i];

            }

            else if (arr[i] > posb)

                posb = arr[i];

            if (arr[i]

                              Math.Abs(nega))

            {

                negb = nega;

                nega = arr[i];

            }

            else if(arr[i]

                    Math.Abs(arr[i]) >

                    Math.Abs(negb))

                negb = arr[i];

        }

        if (nega * negb > posa * posb)

            Console.WriteLine("Max product pair is {"

                        + nega + ", " + negb + "}");

        else

            Console.WriteLine("Max product pair is {"

                        + posa + ", " + posb + "}");

    }

    public static void Main()

    {

        int []arr = {1, 4, 3, 6, 7, 0};

        int n = arr.Length;

        maxProduct(arr, n);

    }

}

PHP

function maxProduct(&$arr, $n)

{

    if ($n

    {

        echo("No pairs exists\n");

        return;

    }

    if ($n == 2)

    {

        echo ($arr[0]);

        echo (" ");

        echo($arr[1]);

        echo("\n");

        return;

    }

    $posa = 0;

    $posb = 0;

    $nega = 0;

    $negb = 0;

    for ($i = 0; $i $n; $i++)

    {

        if ($arr[$i] > $posa)

        {

            $posb = $posa;

            $posa = $arr[$i];

        }

        else if ($arr[$i] > $posb)

            $posb = $arr[$i];

        if ($arr[$i]

            abs($arr[$i]) > abs($nega))

        {

            $negb = $nega;

            $nega = $arr[$i];

        }

        else if($arr[$i]

            abs($arr[$i]) > abs($negb))

            $negb = $arr[$i];

    }

    if ($nega * $negb > $posa * $posb)

    {

        echo("Max product pair is {");

        echo $nega;

        echo(", ");

        echo ($negb);

        echo ("}");

    }

    else

    {

        echo("Max product pair is {");

        echo $posa;

        echo(", ");

        echo ($posb);

        echo ("}");

    }

}

$arr = array(1, 4, 3, 6, 7, 0);

$n = sizeof($arr);

maxProduct($arr, $n);

?>