chapter 8

summary.md

@@ -19,6 +19,7 @@
 rounds.
 - 4.2: Any deterministic algorithm for 3-coloring n-node directed paths needs at least $`\frac{\log∗ n}{2}− 2`$
 rounds.
+- 8.4: If an oblivious comparison-exchange algorithm sorts all inputs of 0’s and 1’s, then it sorts arbitrary inputs.
 ## Algorithms
 
 ### Coloring
@@ -54,5 +55,19 @@ rounds.
 |Pointer Forwarding|![pointer_forwarding](images/pointer_forwarding.png)|
 |Ivy|![ivy](images/ivy.png)|
 
+### Sorting
+|Name|Algorithm|Steps|
+|---|---|---|
+|Odd/Even|![odd_even](images/odd_even.png)|$`O(n)`$|
+|Shear|![shear](images/shear.png)|$`O(\sqrt{n}\log(n))`$|
+
+### Sorting Networks
+|Name|Algorithm|Dept|
+|---|---|---|
+|Half Cleaner|![half_cleaner](images/half_cleaner.png)<br>Feeding a bitonic sequence into a half cleaner, the half cleaner cleans (makes all-0 or all-1) either the upper or the lower half of the n wires. The other half is bitonic.|$`n`$|
+|Bitonic Sequence Sorter|![bitonic_sequence_sorter](images/bitonic_sequence_sorter.png)<br>A bitonic sequence sorter of width n sorts bitonic sequences. It has depth log n|$`\log n`$|
+|Merging Network|![merging_network](images/merging_network.png)<br>A merging network of width n merges two sorted input sequences of length n/2 each into one sorted sequence of length n.|$`1+2\log n`$|
+|Batcher Network|![batcher](images/batcher.png)<br>A sorting network (Algorithm 8.18) sorts an arbitrary sequence of n values.|$`O(\log^2n)`$|
+
 
 ## Structures
\ No newline at end of file