I looked at itsEMILagain's wonderful faster version of Circles That Kiss and I wondered how a bisection search would work in this application. So I set one up. Seems to work pretty well...hard to say if it's faster than itsEMILagain's routine though. Original notes from itsEMILagain: This is based on the idea of this project by Nid: http://scratch.mit.edu/projects/NiD/214336 i thougt i could make it faster and a lot simpler. seems like i could, doesn't it? its one sprite, one script. please comment!
