Introduction to Computer Science

  • 1 - A naive algorithm for finding the greatest common divisor

  • 2 - The Euclidean algorithm for finding the greatest common divisor

  • 3 - The g.c.d. algorithms as functions

  • 4 - Searching and sorting algorithms

  • 5 - Recursive computation of binomial coefficients

  • 6 - Recursive computation of the function tg(x)

  • 7 - A recursive version of the Euclidean algorithm

  • 8 - A recursive version of binary search

  • 9 - Recursive computation of the functions sin(x) and cos(x)

  • 10 - The mergesort sorting algorithm

  • 11 - Enumerating all subsets of size k of {1,2,...,n}

  • 12 - The classical Towers of Hanoi Problem

  • 13 - A simple example using objects

  • 14 - Objects: points and intervals in 2D

  • 15 - The knight tour problem (solved by greedy algorithm)

  • 16 - A version of the drunkard's walk in the plane

  • 17 - A basic example of inheritance

  • 18 - Solving the equation f(x)=0 by two algorithms