Sort primes from list to a list: Difference between revisions
Content added Content deleted
No edit summary |
No edit summary |
||
Line 731: | Line 731: | ||
{{out}} |
{{out}} |
||
<pre>[2, 7, 13, 43, 103] |
<pre>[2, 7, 13, 43, 103] |
||
</pre> |
|||
=={{header|Rust}}== |
|||
<syntaxhighlight lang="rust>fn is_prime( number : u32 ) -> bool { |
|||
let result : bool = match number { |
|||
0 => false , |
|||
1 => false , |
|||
2 => true , |
|||
_ => { |
|||
let limit : u32 = (number as f32).sqrt( ).floor( ) as u32 ; |
|||
(2..=limit).filter( | &d | number % d == 0 ).count( ) == 0 |
|||
} |
|||
} ; |
|||
result |
|||
} |
|||
fn main() { |
|||
let numbers : Vec<u32> = vec![2 , 43 , 81 , 122 , 63 , 7 , 95 , 103] ; |
|||
let mut primes : Vec<u32> = numbers.into_iter( ).filter( | &d | is_prime( d ) ). |
|||
collect( ) ; |
|||
primes.sort( ) ; |
|||
println!("{:?}" , primes ) |
|||
} |
|||
</syntaxhighlight> |
|||
{{out}} |
|||
<pre> |
|||
[2, 7, 43, 103] |
|||
</pre> |
</pre> |
||