Hmm. Is it really the case that julia arrays are slower on larger data? Arrays in general are constant time and hash tables are generally implemented as arrays (using a hash function) and some way to avoid hash collisions. The constant time part (if there are no collisions) of value retrieval in a hash table generally comes from it being implemented as an array.
Yes, if you know where the item is located it is constant time in the case of an array and for a dictionary. Note that the constant time is different for an array and a dictionary where the dictionary is slower. If you do not know where the item is stored you need to find it. This is linear time in the case of an array and still the same hash function for a dictionary. Also a dictionary is easier to interpret for humans since it tells you (with good variable naming) whar you are looking for instead of you knowing that the first index is important for x....
![[10x16] How to use a struct in Julia](http://i.ytimg.com/vi/e5_PUNZdDsQ/mqdefault.jpg)
![[10x16] How to use a struct in Julia](/img/tr.png)
![[10x24] What does "Multiple Dispatch" mean in Julia?](http://i.ytimg.com/vi/hesjQz__yb8/mqdefault.jpg)
![[10x27] How to use External Packages in Julia](/img/1.gif)
Didn't know about the pop! function until now. Learned something new 👍
The visualization at the end is very useful 👍 looking forward to see where struct fits in on those axes.
Glad you liked it! I don't have a visual for a struct, but in my opinion, a struct is somewhere between a NamedTuple and an Array.
you should make an intermediate tutorial series.
Hmm. Is it really the case that julia arrays are slower on larger data? Arrays in general are constant time and hash tables are generally implemented as arrays (using a hash function) and some way to avoid hash collisions. The constant time part (if there are no collisions) of value retrieval in a hash table generally comes from it being implemented as an array.
Yes, if you know where the item is located it is constant time in the case of an array and for a dictionary. Note that the constant time is different for an array and a dictionary where the dictionary is slower.
If you do not know where the item is stored you need to find it. This is linear time in the case of an array and still the same hash function for a dictionary.
Also a dictionary is easier to interpret for humans since it tells you (with good variable naming) whar you are looking for instead of you knowing that the first index is important for x....
teach us geospatial data analysis in julia, please! :) come on you know it would be fun
I shall put it on my "to do" list!