This is an elementary question about algorithm. My algorithm is probably already usable but I wonder if there is a faster algorithm that can be implemented with Julia (e.g. even not using findmax) import Random; Random.seed!(6); N = 10; # length of the value vector val_vec = rand(-9:.1:9, N); # g…

[image] WalterMadelim: Actually if parallel computing is equipped, this is a lesser issue. I think this issue is already addressed here .

Find the max element of a numeric vector iteratively with mask and early break

WalterMadelim September 16, 2025, 9:01am 11

I think this issue is already addressed here.

Topic		Replies	Views
Speeding up creation of maximum mask array Performance	11	1208	August 17, 2020
Performance of findmax vs. raw loop General Usage	12	862	July 19, 2020
The quasi-best MaxN function Performance	12	1411	January 6, 2021
Rolling maxima Performance	24	1736	February 2, 2020
Poor performance due to memory allocations? Performance memory-allocation	17	2874	January 15, 2019