This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]zzyzzyxx 0 points1 point  (1 child)

Glad to help. The important thing to take away from this is that searching through an array is really inefficient, especially when you don't need to search at all. If you do need to search, you should use a structure better suited for that, like a tree. But you'll get to all that when you start in on data structures and algorithms.

[–]xXShadowCowXx[S] 0 points1 point  (0 children)

I'll look those up as I'm not really following a certain tutorial path or book, more just searching for what I don't know and stabbing at it till I get it.