The main issue being discussed this week is run time analysis, different sort method and the efficiency of the sort methods.
We spent more time on run time analysis this week but the instructor did not discuss in great details how do we find the big-oh of a certain algorithm except for the selection sort. I am hoping to get some instructions on how to practice this problem more and the way that we are going to be tested on finals.
In addition, we have seen examples of different sort algorithm including selection sort, merge sort and quick sort.
PS: I have a question about the code on def merge(L1, L2). What does 'while L1 and L2' means?
No comments:
Post a Comment