Programin-in-C

From the class at Cinvestav GDL. As this class progress more software will be added to it as we go along

For now, we have:

Homework 2

1. Gauss Trick:
   • It is code ready for using the gauss trick using << and recursion, but improvements were asked at the homework.
2. Binary Search Tree:
   • The solution for the use of iterators and stacks for inserting in a binary search tree.

Homework 3

We implement a simple quicksort with a random pivot (Here we would like to see if the studentsw try to look at some of the pseudo random generators) in a tail recursion way. Then using -O3 to see how you have loops instead of recursive calls.

Note we started to use unit test using function pointer and preprocessor register functions to organize better the results.