- Joined
- Sep 28, 2004
- Messages
- 365
Hi all, i am confuse about indexing.
It uses an array with size of 1.
Lets say i use the below array as an example
a[x]
But if its size of 1, how is it able to store if x is more than 0? I thought the number of x means the current index of the array size. if x = 5 then the array size should be 6 assuming i start from 0. Am i wrong?
Please help me. Because i really don't get how indexing works. I really want to know it because it is alot more efficient than hashtables. I remember theres a tutorial somewhere, i just can't find it anymore.
It uses an array with size of 1.
Lets say i use the below array as an example
a[x]
But if its size of 1, how is it able to store if x is more than 0? I thought the number of x means the current index of the array size. if x = 5 then the array size should be 6 assuming i start from 0. Am i wrong?
Please help me. Because i really don't get how indexing works. I really want to know it because it is alot more efficient than hashtables. I remember theres a tutorial somewhere, i just can't find it anymore.