Dear Monks,
I am very much amazed by the fastness of the index function which out throws any other function that returns the position of a substring.
So, All I wanted to know is what makes the index function faster, is there any algorithm on which index function has been built or it is some else which make index function faster.
(I have already asked this question in Chatter box, but as I couldn't find an answer i am posting this question)
In reply to How Index function works?? by saranrsm
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |