Formatted with Google Java Formatter

Misc/MedianOfRunningArray.java

@@ -3,50 +3,44 @@ package Misc;
 import java.util.Collections;
 import java.util.PriorityQueue;
 
-
-/**
- * @author shrutisheoran
- */
+/** @author shrutisheoran */
 public class MedianOfRunningArray {
-    private PriorityQueue<Integer> p1;
-    private PriorityQueue<Integer> p2;
+  private PriorityQueue<Integer> p1;
+  private PriorityQueue<Integer> p2;
 
-    //Constructor
-    public MedianOfRunningArray() {
-        this.p1 = new PriorityQueue<>(Collections.reverseOrder()); //Max Heap
-        this.p2 = new PriorityQueue<>(); //Min Heap
-    }
+  // Constructor
+  public MedianOfRunningArray() {
+    this.p1 = new PriorityQueue<>(Collections.reverseOrder()); // Max Heap
+    this.p2 = new PriorityQueue<>(); // Min Heap
+  }
 
-    /* 
-        Inserting lower half of array to max Heap
-        and upper half to min heap
-    */
-    public void insert(Integer e) {
-        p2.add(e);
-        if (p2.size() - p1.size() > 1)
-            p1.add(p2.remove());
-    }
+  /*
+      Inserting lower half of array to max Heap
+      and upper half to min heap
+  */
+  public void insert(Integer e) {
+    p2.add(e);
+    if (p2.size() - p1.size() > 1) p1.add(p2.remove());
+  }
 
+  /*
+      Returns median at any given point
+  */
+  public Integer median() {
+    if (p1.size() == p2.size()) return (p1.peek() + p2.peek()) / 2;
+    return p1.size() > p2.size() ? p1.peek() : p2.peek();
+  }
+
+  public static void main(String[] args) {
     /*
-        Returns median at any given point
+        Testing the median function
     */
-    public Integer median() {
-        if (p1.size() == p2.size())
-            return (p1.peek() + p2.peek()) / 2;
-        return p1.size() > p2.size() ? p1.peek() : p2.peek();
+
+    MedianOfRunningArray p = new MedianOfRunningArray();
+    int arr[] = {10, 7, 4, 9, 2, 3, 11, 17, 14};
+    for (int i = 0; i < 9; i++) {
+      p.insert(arr[i]);
+      System.out.print(p.median() + " ");
     }
-
-    public static void main(String[] args) {
-        /*
-            Testing the median function
-        */
-
-        MedianOfRunningArray p = new MedianOfRunningArray();
-        int arr[] = {10, 7, 4, 9, 2, 3, 11, 17, 14};
-        for (int i = 0; i < 9; i++) {
-            p.insert(arr[i]);
-            System.out.print(p.median() + " ");
-        }
-    }
-
-}
+  }
+}

Misc/PalindromePrime.java

@@ -4,44 +4,44 @@ import java.util.Scanner;
 
 public class PalindromePrime {
 
-    public static void main(String[] args) { // Main funtion
-        Scanner in = new Scanner(System.in);
-        System.out.println("Enter the quantity of First Palindromic Primes you want");
-        int n = in.nextInt(); // Input of how many first pallindromic prime we want
-        functioning(n); // calling function - functioning  
-        in.close();
-    }
+  public static void main(String[] args) { // Main funtion
+    Scanner in = new Scanner(System.in);
+    System.out.println("Enter the quantity of First Palindromic Primes you want");
+    int n = in.nextInt(); // Input of how many first pallindromic prime we want
+    functioning(n); // calling function - functioning
+    in.close();
+  }
 
-    public static boolean prime(int num) { // checking if number is prime or not
-        for (int divisor = 3; divisor <= Math.sqrt(num); divisor += 2) {
-            if (num % divisor == 0) {
-                return false; //  false if not prime
-            }
-        }
-        return true; // True if prime
+  public static boolean prime(int num) { // checking if number is prime or not
+    for (int divisor = 3; divisor <= Math.sqrt(num); divisor += 2) {
+      if (num % divisor == 0) {
+        return false; //  false if not prime
+      }
     }
+    return true; // True if prime
+  }
 
-    public static int reverse(int n) { //  Returns  the reverse of the number
-        int reverse = 0;
-        while (n != 0) {
-            reverse *= 10;
-            reverse += n % 10;
-            n /= 10;
-        }
-        return reverse;
+  public static int reverse(int n) { //  Returns  the reverse of the number
+    int reverse = 0;
+    while (n != 0) {
+      reverse *= 10;
+      reverse += n % 10;
+      n /= 10;
     }
+    return reverse;
+  }
 
-    public static void functioning(int y) {
-        if (y == 0) return;
-        System.out.print(2 + "\n"); // print the first Palindromic Prime
-        int count = 1;
-        int num = 3;
-        while (count < y) {
-            if (num == reverse(num) && prime(num)) { // number is prime and it's reverse is same
-                count++; // counts check when to terminate while loop
-                System.out.print(num + "\n"); // print the Palindromic Prime
-            }
-            num += 2; // inrease iterator value by two
-        }
+  public static void functioning(int y) {
+    if (y == 0) return;
+    System.out.print(2 + "\n"); // print the first Palindromic Prime
+    int count = 1;
+    int num = 3;
+    while (count < y) {
+      if (num == reverse(num) && prime(num)) { // number is prime and it's reverse is same
+        count++; // counts check when to terminate while loop
+        System.out.print(num + "\n"); // print the Palindromic Prime
+      }
+      num += 2; // inrease iterator value by two
     }
+  }
 }