1. Sort and Tree 2014 Spring CS32 Discussion Jungseock Joo

2. - From wikipedia.com Selection Sort

3. Bubble Sort

4. Merge Sort

5. Quicksort

6. Time Complexity Divide-and-conquer : O(n log 2 n) Otherwise, O(n 2 )

7. When use what? In practice – std::sort(); – If n is small, you may choose simpler ones. Considerations – Worst-case performance? – Already sorted? Partially-already sorted? Reversed order? – # of comparisons vs. # of swap/shift

8. Binary Search Tree Find 7?

9. Binary Search Tree Find 7? – O(log n) Depth of tree ~ log n If balanced.

10. Binary Search Tree But, O(n) in unbalanced BSTs – Depth >> log n Depth of tree ~ n If unbalanced.

11. Code example

12. Sum of items?

14. Tree Traversal