diff --git a/slides/cse4562sp2018/2018-02-14-ExtRA.html b/slides/cse4562sp2018/2018-02-14-ExtRA.html index 5ac94534..61af84f8 100644 --- a/slides/cse4562sp2018/2018-02-14-ExtRA.html +++ b/slides/cse4562sp2018/2018-02-14-ExtRA.html @@ -77,6 +77,12 @@ + + Outer Join + + + + Sort / Limit @@ -93,8 +99,28 @@ - Distinct + Sort + + Pick your favorite sort algorithm. + + + What happens if you don't have enough memory? + + + + Key Idea: Merging 2 sorted lists requires $O(1)$ memory. + + + + 2-Way Sort + + Pass 1 + Create lots of (small) sorted lists. + + Pass 2+ + Merge sorted lists of size $N$ into sorted lists of size $2N$ +
+ Pick your favorite sort algorithm. +
What happens if you don't have enough memory?
Key Idea: Merging 2 sorted lists requires $O(1)$ memory.