FYI: As you divide the Problem by two (2) each time, two is synonymous with binary. So you have suggested a version of "binary search".
You can even do this without numbers. For example if you can't connect to google search. *Your Browser*, on your desktop, on your home network, *your home router*, your ISP, on the internet, google servers, *google search* You could see if the problem is your home router, then to the left or right of your Home Router depending on success or failure. You should be proud of re-inventing the wheel, it's a sign of genius, of local invention, if not the first or global invention. Regards Tony On Wednesday, 20 February 2019 14:14:00 UTC+11, S. S. wrote: > > > Tony, > > I have no idea what a binary search is. I am not a programmer! > Now I did the difficult part, laying out the logic, which works! > I'll leave the easy part to the programmers. > > Cheers! > > On Wednesday, February 20, 2019 at 9:31:09 AM UTC+7, TonyM wrote: >> >> S S , >> >> A Form of Binary search? Nice algorithm. >> >> . . . >> >> I have no doubt your algoritium could be essential in other data cases. >> >> How do you think it would be implemented in TiddlyWiki? >> >> Regards >> Tony >> >> -- You received this message because you are subscribed to the Google Groups "TiddlyWiki" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/tiddlywiki. To view this discussion on the web visit https://groups.google.com/d/msgid/tiddlywiki/09c40071-b2ac-4d60-93a8-9d576b42c2ad%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
