Introduction to Computer Science

  • 1 - A simple Java program

  • 2 - Basic algorithms for finding the greatest common divisor

  • 3 - An improved version of the preceding example

  • 4 - Recursive computation of binomial coefficients

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

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

  • 7 - First example in objects (points and intervals in 2D)

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

  • 9 - The preceding example with some revisions

  • 10 - Finding minima of functions of several variables

  • 11 - Searching and sorting algorithms

  • 12 - Sorting any comparable elements using interface Comparable

  • 13 - We define and use an interface for random selections

  • 14 - The classical Towers of Hanoi Problem (pegs viewed as stacks)

  • 15 - A generalized version of the Towers of Hanoi Problem

  • 16 - A version of Josephus Problem