cleaned imports and added function calls to Templator
This commit is contained in:
parent
4086990c0f
commit
86f63326b6
123 changed files with 467 additions and 561 deletions
|
|
@ -22,11 +22,11 @@
|
|||
|
||||
package zutil.algo;
|
||||
|
||||
import zutil.io.MultiPrintStream;
|
||||
|
||||
import java.math.BigInteger;
|
||||
import java.util.LinkedList;
|
||||
|
||||
import zutil.io.MultiPrintStream;
|
||||
|
||||
/**
|
||||
* Euclidean algorithm is an algorithm to determine
|
||||
* the greatest common divisor (GCD)
|
||||
|
|
|
|||
|
|
@ -22,11 +22,11 @@
|
|||
|
||||
package zutil.algo;
|
||||
|
||||
import zutil.math.ZMath;
|
||||
|
||||
import java.math.BigInteger;
|
||||
import java.util.LinkedList;
|
||||
|
||||
import zutil.math.ZMath;
|
||||
|
||||
/**
|
||||
* The Wieners algorithm factorizes two big numbers a and b.
|
||||
* It uses the Euclidien algorithm to calculate the generator of the
|
||||
|
|
|
|||
|
|
@ -22,13 +22,7 @@
|
|||
|
||||
package zutil.algo.sort;
|
||||
|
||||
import java.io.BufferedReader;
|
||||
import java.io.BufferedWriter;
|
||||
import java.io.File;
|
||||
import java.io.FileNotFoundException;
|
||||
import java.io.FileReader;
|
||||
import java.io.FileWriter;
|
||||
import java.io.IOException;
|
||||
import java.io.*;
|
||||
import java.util.Collections;
|
||||
import java.util.Iterator;
|
||||
import java.util.LinkedList;
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue