Ask a quick question about the built in dragon list item that you have a list with the number 0 - 99. Are you writing a program that takes the last item in the list and uses it for any other purpose is to use the list [[99]) to make the list more efficient than [-1]? In other words, repeat the dragon again in the entire list?
Thank you for your help.
No special index lists again, through inventory to search for dragon arrays in infected memory (elements Hint) and therefore there is always a simple multiplication and addition to locate the desired element. If anything, the list [-1] will be slightly slower because Python needs to add negative indices in length to get the real index. (I suspect that this is obvious is slow, though, because whatever has been done in C.)
Comments
Post a Comment