Data Structure
Bubble Sort Code
public class BubbleSort { private int[] a; public BubbleSort(int [] inputArray) { a = inputArray; } public void bubbleSort() { for (int out = a.length - 1; out > 1; out--) { for (int in Read more…
Data Structure
Recursion
Is Recursion Efficient? Calling a method involves certain overhead. Control must be transferred from the location of the call to the beginning of the method. In addition, the arguments to the method and the address Read more…
Data Structure
Factorial via Recursion Code
public class Factorial { public static int factorial(int n) { if (n == 0) return 1; else return (n * factorial(n - 1)); } public static void main(String args[]) { System.out.println(factorial(5)); }}