Computer science is all about algorithms. And hardly any of them is as mind-blowing as recursion. In this Semilab, I intend to make the recursive approach your favorite solution. We will explore number representations by computers, including floating point types, factorial, Euclid algorithm for GCD of two numbers, binary search, Fibonacci numbers, recursion performance, and efficiency. Topics will be adjusted based on the group's interest. We will be using Spider IDE.
Prerequisites: To take this Semilab you need to have basic knowledge of Python: how to write a simple computational expression, flow controls: while, if, for i in, functions, lists.