- Joined
- Nov 9, 2017
- Messages
- 14
Hello all script writers sorry I'm noob on this topic.
I think that hashtables look similar to arrays of arrays (2d arrays) because 2 indexes are used to recover one value, just like column and row number in a paper table, but they have different names and people write that hashtables hold a larger number than a 2d array.
I am sure that they are different somehow. I want to understand more completely: how is that hash tables can hold so many values that not even an array of an array could? What are other differences?
Please keep simple the answers, because things too technical I would'nt understand. If you could make simple examples to make distinction appear evident, it'd be the best.
I think that hashtables look similar to arrays of arrays (2d arrays) because 2 indexes are used to recover one value, just like column and row number in a paper table, but they have different names and people write that hashtables hold a larger number than a 2d array.
I am sure that they are different somehow. I want to understand more completely: how is that hash tables can hold so many values that not even an array of an array could? What are other differences?
Please keep simple the answers, because things too technical I would'nt understand. If you could make simple examples to make distinction appear evident, it'd be the best.
Last edited: