Good evening,

I had some fun today creating a video tutorial of me searching for a word "Mitternacht" in a German dictionary of 500,000 words using a binary search. We converged incredibly quickly on the word. Certainly faster than if we went through linearly starting with "Aardvark".

I then illustrated some of the common computational time complexities in code, showing linear, quadratic and logarithmic.

The level is extremely basic beginner. If you've done /any/ Computer Science degree, then this tutorial is too basic for you and I'd suggest you skip it (unless you want to watch the fun of binary searching through a dictionary).

http://www.javaspecialists.eu/tutorials/004-Computational-time-complexity-trumps-brute-force-parallelism.html

Kind regards

Heinz

P.S. My regular newsletter is planned for after Christmas but before New Year.
P.P.S. JCrete 2017 invitations have not been sent out yet. In case you haven't received yours yet - that's the reason :-)

If you no longer wish to receive our emails, click the link below:

https://iw127.infusionsoft.com/app/optOut/8/a6ca3d5100f0d052/3629316/83918c2016e616d7

Cretesoft Limited 77 Strovolos Ave Strovolos, Lefkosia 2018 Cyprus