fswatch docs

Author: amejiarosario

book/chapters/bubble-sort.adoc

@@ -28,6 +28,6 @@ Bubble sort has a <<Quadratic>> running time, as you might infer from the nested
 - <<Stable>>: [big]#✅# Yes
 - <<In-place>>: [big]#✅# Yes
 - <<Online>>: [big]#✅# Yes
-- <<Adaptive>>: [big]#✅# Yes
+- <<Adaptive>>: [big]#✅# Yes, _O(n)_ when already sorted
 - Time Complexity: [big]#⛔️# <<Quadratic>> _O(n^2^)_
 - Space Complexity: [big]#✅# <<Constant>> _O(1)_

notes.md

@@ -8,6 +8,19 @@
 - [ ] Algorithms visualizations like https://bost.ocks.org/mike/algorithms/
 - [ ] sorting algorithms needs a comparator. So, it can sort objects as well. Replace `Array.sort` for `mergesort` in `src/algorithms/knapsack-fractional.js`
 
+# Watcher
+
+Install fswatch http://emcrisostomo.github.io/fswatch/usage.html
+```sh
+# Watch for changes
+brew install fswatch
+```
+
+Watch for changes in *.js and *.adoc
+```sh
+fswatch /Users/admejiar/Code/algorithmsJS/src/**/*.js /Users/admejiar/Code/algorithmsJS/**/*.adoc | xargs -n1 -I{} make pdf
+```
+
 # Troubleshooting
 Some notes while working on this project
 
@@ -50,3 +63,4 @@ alert('foo');
 console.log('bar');
 /* eslint-enable no-alert */
 ```
+