In Python, I tried many ways to apply roll rank function to a list, the speed is too slow. When the list length is about 100000, the fastest way in Python I tried takes more than 100ms. Then in Juila, I tried the similar way used in Python, It still takes 80ms to the calculation. So, my question …

It looks to me like the most obvious problems are fixed. In order to speed this up, I think a bit more thorough work is needed. Re-using vectors instead of creating new ones all the time. Make sure that insert! doesn’t need to re-allocate many times.

When appllying roll rank function, how much faster Julia can be compared to Python?

New to Julia

Brian1 March 18, 2022, 9:10am 15

Yes, of course. The difference lies in computer. My computer is out of time. Your computer is wonderful, maybe it has the 12th generation cpu?

Topic		Replies	Views
Ironic observation about `sort` and `sortperm` speed for "small integers" vs R Performance sort , sortperm , r	32	4787	February 4, 2018
JuliaDB: efficiently rank subgroups Data	2	807	May 20, 2019
Sort on tuple is > 4x as fast as sortrows on the equivalent array General Usage performance , sort	2	676	September 13, 2017
Efficient way to apply monotonous rank transformation to an array Performance	4	496	April 16, 2020
ANN: JJ.jl -- library for J-like verb rank in Julia Package Announcements	9	1291	June 28, 2022

When appllying roll rank function, how much faster Julia can be compared to Python?

Related topics