## Factorial

0 likes • Nov 19, 2022
Java

## More Java Posts

### quick sort

CodeCatch
0 likes • Nov 19, 2022
Java
`import java.util.Arrays; public class QuickSortMain {     private static int array[];     public static void sort(int[] arr) {         if (arr == null || arr.length == 0) {            return;        }        array = arr;        quickSort(0, array.length-1);    }     private static void quickSort(int left, int right) {         int i = left;        int j = right;        // find pivot number, we will take it as mid        int pivot = array[left+(right-left)/2];         while (i <= j) {            /**             * In each iteration, we will increment left until we find element greater than pivot             * We will decrement right until we find element less than pivot             */            while (array[i] < pivot) { i++; } while (array[j] > pivot) {                j--;            }            if (i <= j) {                exchange(i, j);                //move index to next position on both sides                i++;                j--;            }        }        // call quickSort() method recursively        if (left < j)            quickSort(left, j);        if (i < right)            quickSort(i, right);    }     private static void exchange(int i, int j) {        int temp = array[i];        array[i] = array[j];        array[j] = temp;    }     public static void main(String a[]){        int[] input = {33,21,45,64,55,34,11,8,3,5,1};        System.out.println("Before Sorting : ");        System.out.println(Arrays.toString(input));        sort(input);        System.out.println("==================");        System.out.println("After Sorting : ");        System.out.println(Arrays.toString(array));     }}`

### Puzzle 1

Daedalus
0 likes • Feb 6, 2021
Java
```import java.util.Scanner;
/* In Heaven, the seed is tall and the oak small / It's input vital 	* "The al-Madinatian," verse 236-37 	* tinyurl.com/17snqkfv	* email answer to [email protected]	**/
public class Main{	public static void main(String args[])	{		int x = 0;		int a, c, m = 10000;				Scanner in = new Scanner(System.in);				System.out.println("Please enter a seed, maximum 3000000:");		x = in.nextInt();				System.out.println("Please input a number, maximum 29:");		a = in.nextInt();				System.out.println("Please input a number, maximum 999999:");		c = in.nextInt();				char menu = 'y';		while(menu != 'n')		{			x = (a*x + c) % m;						System.out.println("The next number is " + x + "\nWould you like another? (y/n)");			menu = in.next().charAt(0);		}	}}
//██╗  ░█████╗░███╗░░░███╗  ██████╗░░█████╗░███████╗██████╗░░█████╗░██╗░░░░░██╗░░░██╗░██████╗//██║  ██╔══██╗████╗░████║  ██╔══██╗██╔══██╗██╔════╝██╔══██╗██╔══██╗██║░░░░░██║░░░██║██╔════╝//██║  ███████║██╔████╔██║  ██║░░██║███████║█████╗░░██║░░██║███████║██║░░░░░██║░░░██║╚█████╗░//██║  ██╔══██║██║╚██╔╝██║  ██║░░██║██╔══██║██╔══╝░░██║░░██║██╔══██║██║░░░░░██║░░░██║░╚═══██╗//██║  ██║░░██║██║░╚═╝░██║  ██████╔╝██║░░██║███████╗██████╔╝██║░░██║███████╗╚██████╔╝██████╔╝//╚═╝  ╚═╝░░╚═╝╚═╝░░░░░╚═╝  ╚═════╝░╚═╝░░╚═╝╚══════╝╚═════╝░╚═╝░░╚═╝╚══════╝░╚═════╝░╚═════╝░```
```import java.io.File;import java.io.IOException;import java.util.Map;import java.util.Scanner;import java.util.TreeMap;
public class SimpleWordCounter {        public static void main(String[] args) {        try {            File f = new File("ciaFactBook2008.txt");            Scanner sc;            sc = new Scanner(f);            // sc.useDelimiter("[^a-zA-Z']+");            Map<String, Integer> wordCount = new TreeMap<String, Integer>();            while(sc.hasNext()) {                String word = sc.next();                if(!wordCount.containsKey(word))                    wordCount.put(word, 1);                else                    wordCount.put(word, wordCount.get(word) + 1);            }                        // show results            for(String word : wordCount.keySet())                System.out.println(word + " " + wordCount.get(word));            System.out.println(wordCount.size());        }        catch(IOException e) {            System.out.println("Unable to read from file.");        }    }}```
`public class Solution {    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {        ListNode head = new ListNode(0);        ListNode handler = head;        while(l1 != null && l2 != null) {            if (l1.val <= l2.val) {                handler.next = l1;                l1 = l1.next;            } else {                handler.next = l2;                l2 = l2.next;            }            handler = handler.next;        }                if (l1 != null) {            handler.next = l1;        } else if (l2 != null) {            handler.next = l2;        }                return head.next;    }}`
```import static java.lang.System.*;import java.util.Arrays;
public class MergeSort{
private static int passCount;
public static void mergeSort(int[] list){    passCount=0;    mergeSort(list, 0, list.length);}
private static void mergeSort(int[] list, int front, int back)  //O( Log N ){    int mid = (front+back)/2;    if(mid==front) return;    mergeSort(list, front, mid);    mergeSort(list, mid, back);    merge(list, front, back);
}
private static void merge(int[] list, int front, int back)  //O(N){   int dif = back-front;   int[] temp = new int[dif];   int beg = front, mid = (front+back)/2;   int saveMid = mid;   int spot = 0;
while(beg < saveMid && mid < back) {      if(list[beg] < list[mid]) {         temp[spot++] = list[beg++];      } else {         temp[spot++] = list[mid++];      }   }   while(beg < saveMid)      temp[spot++] = list[beg++];   while(mid < back)      temp[spot++] = list[mid++];   for(int i = 0; i < back-front; i++) {      list[front+i] = temp[i];   }    System.out.println("pass " + passCount++ + " " + Arrays.toString(list) + "\n");  }        public static void main(String args[])    {        mergeSort(new Comparable[]{ 9, 5, 3, 2 });        System.out.println("\n");                mergeSort(new Comparable[]{ 19, 52, 3, 2, 7, 21 });        System.out.println("\n");                mergeSort(new Comparable[]{ 68, 66, 11, 2, 42, 31});        System.out.println("\n");    }   }```
```public static void enu2ecefCov(GMatrix ecefCov, GMatrix enuCov, LLA refLLA) {    double lambda = refLLA.longitude;    double phi = refLLA.latitude;        GMatrix R = new GMatrix(6, 6);    GMatrix Rt = new GMatrix(6, 6);    GMatrix tmp1 = new GMatrix(6, 6);    GMatrix tmp2 = new GMatrix(6, 6);        R.setElement(0, 0, -Math.sin(lambda));    R.setElement(0, 1, -Math.sin(phi)*Math.cos(lambda));    R.setElement(0, 2, Math.cos(phi)*Math.cos(lambda));    R.setElement(1, 0, Math.cos(lambda));    R.setElement(1, 1, -Math.sin(phi)*Math.sin(lambda));    R.setElement(1, 2, Math.cos(phi)*Math.sin(lambda));    R.setElement(2, 0, 0);    R.setElement(2, 1, Math.cos(phi));    R.setElement(2, 2, Math.sin(phi));    R.setElement(3, 3, -Math.sin(lambda));    R.setElement(3, 4, -Math.sin(phi)*Math.cos(lambda));    R.setElement(3, 5, Math.cos(phi)*Math.cos(lambda));    R.setElement(4, 3, Math.cos(lambda));    R.setElement(4, 4, -Math.sin(phi)*Math.sin(lambda));    R.setElement(4, 5, Math.cos(phi)*Math.sin(lambda));    R.setElement(5, 3, 0);    R.setElement(5, 4, Math.cos(phi));    R.setElement(5, 5, Math.sin(phi));
Rt.transpose(R);    tmp1.mul(enuCov, R);    ecefCov.mul(Rt, tmp1);}```