Again, first in the class, we went over assignment 2 part 2.
We went over sorting algorithm and its performance in detail using big O. Why each algorithm takes that much time by examining its sorting method (how many steps it requires to sort a list). For example, for merge sort, we can guess its running time by how many steps there are each time we split and sort the list.
No comments:
Post a Comment