Hi, I am manipulating an matrix (one or more lines) that has the priority numbers of another one, for example: priority = [0.1 0.9 0.4 0.7 0.3] # matrix filled using rand() A = [col1 col2 col3 col4 col5] # matrix filled with rand(0:1) So the order of the matrix A that I want is: [col1, col5, col…

[image] Josa9321: But I need this code to run as fast as possible. Is there any way to do it? If you find yourself repeatedly sorting arrays (which presumably is why it is performance critical), there is a good chance you should use a different data structure.

Faster Alternatives to sortperm

General Usage Performance

Oscar_Smith May 2, 2022, 7:28pm 7

what about a heap based priority queue?

1 Like

Custom data structure for repeatedly partial sorting constant-size array

Topic		Replies	Views
Sortperm slow test case and fix suggestion General Usage sortperm	12	1511	April 28, 2019
Which sorting algorithm should I use? Performance sort , sortperm	2	749	October 31, 2018
Any way to speed up sorting a dataframe? A more efficient sortperm would be great General Usage sort , sortperm , dataframes	2	956	June 25, 2020
Sorting seems to have some low hanging speed fruit for sorting by single column Data performance , sort , dataframes	7	952	December 6, 2017
Is there a more elegant solution than `sortperm(sortperm(...))` Performance question	6	545	February 22, 2020

Faster Alternatives to sortperm

Related topics