A quick implementation of Caesar Cipher in JavaScript using a custom defined modulo function. For more details please check: http://www.codeavenger.com/2017/05/19/JavaScript-Modulo-operation-and-the-Caesar-Cipher.html
This is an example of how to process data in hierarchical structures using either recursion or a stack based approach. To examplify this we will use a didactical example: find the maximum number in an array of arrays. The same techniques can be used to find / process data in other hierarchical structure such as XML documents, JSON objects, etc.
These examples shows to JavaScript programmers coming from standard OOP languages how to achieve encapsulation in JavaScript.
To try these examples, just download the gist on your local computer and open the .html files.
Alternatively, you can play with these examples online via jsbin.com: