Work in pairs:
SORTING
1. Go to ./ex1 directory
a) watch sort1.gif
b) write the sorting scheme in pseudocode
c) write C program which implements the pseudocode
d) assess the complexity of the algorithm
2. Go to ./ex2 directory
a) watch sort2.gif
b) write the sorting scheme in pseudocode
c) write C program which implements the pseudocode
d) assess the complexity of the algorithm
3. Go to ./ex3 directory
a) watch sort3.gif
b) write the sorting scheme in pseudocode
c) write C program which implements the pseudocode
d) assess the complexity of the algorithm
Homework:
1) read about three, randomly selected algorithm and be prepared to explain them in front of the class (the idea, pseudocode, complexity)
2) answer to the question which sort algorithm is the best and why?
-----------------
Work alone
(PSEUDO-)RANDOM NUMBERS
1) use default rand() function for generating A array with 100 random integers*
2) what is the seed and its function (check what is srand doing), random vs. pseudorandom generators
3) name 3 application of using randomness in computer science
4) read about Middle-square method and implement it in C
(https://en.wikipedia.org/wiki/Middle-square_method)
5) read about Mersenne Twister (https://en.wikipedia.org/wiki/Mersenne_Twister)
6) Unix only: read about /dev/random and /dev/urandom and 'od'
* use rand() while implementing and testing Ex. 1-3