about 8 years ago
I have 19 circles in a big circle , I need to write this algorithm
"in case of clicking on a centralized circle (the around circles rotate around it)"
not only rotating (about the around circles - the circle should equal/assigned to it`s following circle)
For the above mentioned problem what we can do is calculate two distance from centralized object .One that is nearest to that object and another that is far from that object.
Now we can maintain two arrays where we kept all those objects with the similar distances .One which have small distance and another which have comparatively large distance.As now we have two arrays containing all together containing 18 objects and there respective position as well.Now start swapping the position from first array element to the one that is next in the array list.
In both the arrays differently.
Hope this work.
Starting with Chrome version 45, NPAPI is no longer supported for Google Chrome. For more information, see Chrome and NPAPI (blog.chromium.org).
Firefox and Microsoft Internet Explorer are recommended browsers for websites using java applets.
Chrome Version Support
Are you sure, you want to delete this comment?
Terms of Service
| © copyright 2023 FindNerd.com. All rights reserved.
Sign up using