------------------------------------------------------------------------------------------

Always document all your codes in a file and bring them to all the classes.
------------------------------------------------------------------------------------------

CSC2105
Algorithms
Week 01 & 02

Laboratory Works:

1. Write and test codes for the follwoing algorithms.

a) Merge Sort
b) Quick Sort
c) Heap Sort
d) Compute and Compare the time complexities among (a), (b) and (c).

2. Write a code to find the two maximum values from a given set of n integers. [n>0]
a) Do it using iteration method.
b) Do it using Recursive method.
c) Compute and Compare the time complexity between the two.

3. Write a code to find the maximum and the minimum values from a given set of n
integers. [n>0]
a) Do it using iteration method.
b) Do it using Recursive method.
c) Compute and Compare the time complexity between the two.

4. Compare the time complexity between 2(b) and 3(b).