Sort primes from list to a list: Difference between revisions

{{libheader|ALGOL 68-primes}}

{{libheader|ALGOL 68-rows}}

PR read "primes.incl.a68" PR # include prime utilities #

PR read "rows.incl.a68" PR # include row (array) utilities #

print( ( newline, " are: " ) );

SHOW ( QUICKSORT prime list FROMELEMENT 1 TOELEMENT p count )[ 1 : p count ]

{{out}}

<pre>

 

=={{header|AutoHotkey}}==

 

t := [], result := []

v := A_Index = 1 ? n : mod(n,A_Index) ? v : v "," A_Index "," n//A_Index

Return (v = n)

{{out}}

<pre>[2, 7, 13, 43, 103]</pre>

 

=={{header|AWK}}==

# syntax: GAWK -f SORT_PRIMES_FROM_LIST_TO_A_LIST.AWK

BEGIN {

return(1)

}

{{out}}

<pre>

==={{header|BASIC256}}===

{{trans|FreeBASIC}}

global temp

 

call sort(temp)

call showArray(temp)

{{out}}

<pre>

 

==={{header|FreeBASIC}}===

 

Function isPrime(Byval ValorEval As Integer) As Boolean

sort(temp())

showArray(temp())

{{out}}

<pre>[2,7,13,43,103]</pre>

 

==={{header|Yabasic}}===

Primes(1) = 2

Primes(2) = 43

txt$ = txt$ + "]"

print txt$

{{out}}

<pre>

=={{header|F_Sharp|F#}}==

This task uses [http://www.rosettacode.org/wiki/Extensible_prime_generator#The_functions Extensible Prime Generator (F#)]

// Primes from a list. Nigel Galloway: Januuary 23rd., 2022

[2;43;81;122;63;13;7;95;103]|>List.filter isPrime|>List.sort|>List.iter(printf "%d "); printfn ""

{{out}}

<pre>

=={{header|Factor}}==

{{works with|Factor|0.99 2021-06-02}}

 

{{out}}

<pre>

=={{header|Go}}==

{{libheader|Go-rcu}}

 

import (

sort.Ints(primes)

fmt.Println(primes)

 

{{out}}

This is a filter (on primality) and a sort (though we could first sort then filter if we preferred):

 

 

=={{header|jq}}==

 

See [[Erdős-primes#jq]] for a suitable definition of `is_prime` as used here.

 

{{out}}

<pre>

 

=={{header|Julia}}==

 

julia> sort(filter(isprime, [2,43,81,122,63,13,7,95,103]))

43

103

 

=={{header|Mathematica}}/{{header|Wolfram Language}}==

{{out}}

<pre>{2, 7, 13, 43, 103}</pre>

 

=={{header|Perl}}==

 

use strict; # https://rosettacode.org/wiki/Sort_primes_from_list_to_a_list

use List::AllUtils qw( nsort_by );

 

{{out}}

<pre>

=={{header|Phix}}==

You could also use unique() instead of sort(), since that (by default) performs a sort() internally anyway. It wouldn't be any slower, might even be better, also it does not really make much difference here whether you filter() before or after the sort(), though of course some more expensive filtering operations might be faster given fewer items.

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #7060A8;">pp</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">sort</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">filter</span><span style="color: #0000FF;">({</span><span style="color: #000000;">2</span><span style="color: #0000FF;">,</span><span style="color: #000000;">43</span><span style="color: #0000FF;">,</span><span style="color: #000000;">81</span><span style="color: #0000FF;">,</span><span style="color: #000000;">122</span><span style="color: #0000FF;">,</span><span style="color: #000000;">63</span><span style="color: #0000FF;">,</span><span style="color: #000000;">13</span><span style="color: #0000FF;">,</span><span style="color: #000000;">7</span><span style="color: #0000FF;">,</span><span style="color: #000000;">95</span><span style="color: #0000FF;">,</span><span style="color: #000000;">103</span><span style="color: #0000FF;">},</span><span style="color: #7060A8;">is_prime</span><span style="color: #0000FF;">)))</span>

{{out}}

<pre>

=={{header|Python}}==

===Python: Procedural===

print("Primes are:")

 

Temp.sort()

print(Temp)

{{out}}

<pre>working...

 

===Python: Functional===

 

 

# MAIN ---

if __name__ == '__main__':

{{Out}}

<pre>[2, 7, 13, 43, 103]</pre>

 

=={{header|Raku}}==

{{out}}

<pre>2 7 13 43 103</pre>

''Of course "ascending" is a little ambiguous. That ^^^ is numerically. This vvv is lexicographically.

{{out}}

<pre>103 13 2 43 7</pre>

 

=={{header|Ring}}==

load "stdlibcore.ring"

? "working"

txt = txt + "]"

? txt

{{out}}

<pre>

 

=={{header|Sidef}}==

{{out}}

<pre>

=={{header|Wren}}==

{{libheader|Wren-math}}

 

var lst = [2, 43, 81, 122, 63, 13, 7, 95, 103]

 

{{out}}

 

=={{header|XPL0}}==

int Primes, Smallest, I, SI;

def Len=9, Inf=1000;

[IntOut(0, Smallest); ChOut(0, ^ )];

until Smallest = Inf;

 

{{out}}