David took the developers through functions, void functions, templates, functions overloading, recursion and finally ended the class by looking at elliptic curve cryptography.
A Detailed Breakdown
The class drill-down included a look at the following:
Different methods of using void functions and explaining their use.
Factorial calculation of a number using recursion.
How to structure a template and using it in the main function under the function template.
How to overload a function using different data types and the use of different perimeter numbers under function overloading.
A demonstration of the formula:and how to implement it in code under the elliptic curve cryptography.
The class was able to understand functions, function overload, recursion, and elliptic curve cryptography by use of examples in the class.
The next class will be a continuation and it will look at Arrays, pointers, character sequences, dynamic memory, data structures, and will finish with a look a practical applications of the above in cryptography.