Update some files

Cargo.toml

@@ -1,6 +1,6 @@
 [package]
 name = "shor"
-version = "0.0.2"
+version = "0.0.3"
 license = "MIT"
 authors = ["itsubaki"]
 description = "Shor's factoring algorithm written in rust"

src/main.rs

@@ -22,15 +22,15 @@ fn main() {
         return;
     }
 
-    if number::is_prime(n) {
-        println!("N={} is prime.", n);
+    if let Some((base, exp)) = number::base_exp(n) {
+        println!("N={}. N is exponentiation. {}^{}.", n, base, exp);
         return;
     }
 
-    if let Some((base, exp)) = number::base_exp(n) {
-        println!("N={}. N is exponentiation. {}^{}.", n, base, exp);
+    if number::is_prime(n) {
+        println!("N={} is prime.", n);
         return;
-    };
+    }
 
     let mut used = vec![];
     loop {

src/number.rs

@@ -157,7 +157,7 @@ pub fn find_order(a: u32, n: u32, bin: &[char]) -> (u32, u32, bool) {
 }
 
 pub fn is_trivial(n: u32, factor: &[u32]) -> bool {
-    for (_, p) in factor.iter().enumerate() {
+    for p in factor.iter() {
         if 1 < *p && *p < n && n % p == 0 {
             return false;
         }