Week 5 - CST 370

 This week we learned about quicksort, median of three, binary tree traversals, decrease and conquer algorithms like binary search, topological sort and insertion sort. Quick sort organizes numbers by choosing a pivot (element in a list) and sorting smaller numbers to left of it and larger numbers to the right. Median of Three quick sort is a more efficient way of sorting in that it chooses a pivot that has a value closer towards the center of a list. Insertion sort orders a list one element at a time, comparing the next element against what is already in an ordered list. 

Comments

Popular posts from this blog

Week 1 - CST 370

Week 1 - CST 438

Week 4