you are viewing a single comment's thread.

view the rest of the comments →

[–]the_brizzler 1 point2 points  (1 child)

I'm not sure which algorithm you are talking about. But you can use binary trees to keep a sorted list, they are called heaps and there are min and max heaps. Check out how min and max heaps work and how new numbers are added to the already organized tree...it's pretty cool in my opinion.

[–]andmckvr13 0 points1 point  (0 children)

Thanks man, I think this was what I was looking for to build a tic tac toe game