Sparse vector uses binary search. Dictionary uses a hash. Anyone has an experience to share?

const NLOOP = 1000000 yields 157.137 ms (0 allocations: 0 bytes) 157.251 ms (0 allocations: 0 bytes) 36.294 ms (0 allocations: 0 bytes) 37.151 ms (0 allocations: 0 bytes) Main.m

What is faster: sparse vector or a dictionary?

General Usage

PetrKryslUCSD March 31, 2024, 11:44pm 12

What if I never defined the name (i.e. used _)? Edit: That wouldn’t have helped at all.

What is the fastest way of making a vector of dictionaries?

Topic		Replies	Views
Fastest way to fill a Sparse Matrix? Performance question	3	1692	April 21, 2022
Sparse arrays of higher order General Usage array	3	753	July 11, 2020
Dict with integer keys and fastest insertion? Performance dictionary , data_structures , hash , algorithm	8	233	January 25, 2025
Binary data reader 200x+ slower on 0.7 Performance	8	1075	July 17, 2018
SparseMatrix is very slow General Usage question	9	1911	March 31, 2020

What is faster: sparse vector or a dictionary?

Related topics