Finally got some time

  So it's been two weeks since the last time I'm here, course went intensive, got 1 midterm, 1 assignment and quiz for every week.
  I found that study the quiz before tutorial is kinda helpful to  get a sense about how the quiz would be like, then read the online text, search for some MI, CI, SI problems on google would help me to get a better understanding of the course material.
  And this week we learned about time complexity, Prof. Heap used merge sort as an example, it reminds me of what we learned in CSC165, basically this example is to analyze the lower and upper bound of the runtime of a sorting algorithm, I assume that we're gonna learn how to prove all the other sorting algorithms, probably by ourselves, in this case, I will start to prove those algorithm runtimes. This runtime analysis can be very helpful for future programming, since the running speed of a program is sometimes crucial in real life.
  Later, I will post my solutions for sorting algorithms.