- What's new and some problems:
On this week’s lecture we’ve ended the chapter of Proof by
introducing some inferences. These inferences briefly and clearly show us how
to prove in some situations and what should do next if we’ve already assume everything.
Additionally, some sorting methods, such
as insertion sort and selection sort have been mention in the lecture. Because I
haven’t learnt these sorting methods before, I’m feeling very confused about
which method is the best and which one takes the least steps if I have a very
large input. Besides, I’m still confusing about when I should use linear search
and when should use insertion sort/selection sort.
没有评论:
发表评论