In Java How would you create a generic method while using re

In Java, How would you create a generic method, while using recursion, to find permutation between two arrays int [] value and int [] suit in a deck of cards

Solution

import java.io.*;

import java.util.*;

import java.lang.Math;

class LIS

{

    // Binary search (note boundaries in the caller)

    // A[] is ceilIndex in the caller

    static int CeilIndex(int A[], int l, int r, int key)

    {

        while (r - l > 1)

        {

            int m = l + (r - l)/2;

            if (A[m]>=key)

                r = m;

            else

                l = m;

        }

        return r;

    }

    static int LongestIncreasingSubsequenceLength(int A[], int size)

    {

        // Add boundary case, when array size is one

        int[] tailTable   = new int[size];

        int len; // always points empty slot

        tailTable[0] = A[0];

        len = 1;

        for (int i = 1; i < size; i++)

        {

            if (A[i] < tailTable[0])

                // new smallest value

                tailTable[0] = A[i];

            else if (A[i] > tailTable[len-1])

                // A[i] wants to extend largest subsequence

                tailTable[len++] = A[i];

            else

                // A[i] wants to be current end candidate of an existing

                // subsequence. It will replace ceil value in tailTable

                tailTable[CeilIndex(tailTable, -1, len-1, A[i])] = A[i];

        }

        return len;

    }

    // Driver program to test above function

    public static void main(String[] args)

    {

        int A[] = { 2, 5, 3, 7, 11, 8, 10, 13, 6 };

        int n = A.length;

        System.out.println(\"Length of Longest Increasing Subsequence is \"+

                            LongestIncreasingSubsequenceLength(A, n));

    }

}