How to convert recursion to loop. Its take longer time than normal time. Its a slow process. how to make it more first using java 8 :  **How to convert recursion to loop. Its take longer time than normal time. 
    Its a slow process. how to make it more first using java 8.**  
                                                                                                                                        
    public class MyClass{

	public static void main(String args[]) {
		int[] testValues = { 3,5,10};
		for (int i = 0; i < testValues.length; ++i) {
			System.out.println(first(testValues[i]));
		}
	}

	public static int first(int a) {
		int b;
		if (a <= 1) {
			if (a == 1) {
				b = convertOne(a);
			} else {
				b = convertTwo(a - 1);
			}
		} else {
			return next(a);
		}
		return b;
	}

	public static int convertOne(int c) {
		return ++c;
	}

	public static int convertTwo(int d) {
		int i = 1;
		for (i = d * 11; i > d; i--) {
			i--;
		}
		return i;
	}

	public static int next(int e) {
		int container = first(e - 1);
		return container + first(e - 2);
	}
    }

Its a slow process. how to make it more first using java 8.