Update a set and set-full description

Closes #41

README.md

@@ -286,6 +286,12 @@ Example of history:
 {:type :ok,     :f :add, :value [0 2], :process 0, :time 11209256522, :index 5}
 ```
 
+Beware, `set` and `set-ful ` have a different computational
+complexities. The `set-full` checker is a lot more expensive, but
+gives you precise bounds on latencies and stability of records
+over time, whereas `set` assumes a single read at the end of the
+test.
+
 ### set-full
 
 A Jepsen's checker for a set histories. It is a more rigorous set analysis. We
@@ -306,6 +312,12 @@ all elements present at that time.
 {:type :invoke, :f :add, :value [0 5], :process 0, :time 11786251931, :index 10}
 ```
 
+Beware, `set` and `set-ful ` have a different computational
+complexities. The `set-full` checker is a lot more expensive, but
+gives you precise bounds on latencies and stability of records
+over time, whereas `set` assumes a single read at the end of the
+test.
+
 ### cas-register
 
 A Knossos checker for CAS (Compare-And-Set) registers. By default