nav[aria-label="Primary Navigation"] { padding: 0; & ul { list-style: none; width: 100%; display: flex; flex-direction: row; justify-content: start; align-items: start; gap: 30px; padding: 0; & li { margin: 0; } & ul li { list-style: none; } } }

How does JSL implement the sorting of memory arrays?

Thanks!

dt = Open( "$SAMPLE_DATA/Big Class.jmp" );
ar = dt << GetAsMatrix( {2, 4} );
ar << Sort( By( 1 ), Order( Descending ), replace table );//？？

Of course, this code is just a try.

Accepted answers

You might find something in Sorting Lists useful. The Rank() function is often overlooked.

All comments

You can sort vectors and lists but I'm not sure if you can sort matrix by specific column. But you can always convert that matrix to private table, sort it and get it back into matrix.

Names Default To Here(1);

dt = Open("$SAMPLE_DATA/Big Class.jmp");
ar = dt << GetAsMatrix({2, 4});

dt_m = As Table(ar, <<private);
dt_m << Sort(By(1), Order(Descending), Replace Table);

ar1 = dt_m[0,0];
Close(dt_m, no save);

show(ar, ar1);

You might find something in Sorting Lists useful. The Rank() function is often overlooked.

Quick Links