Merge branch 'develop'

2 files changed, 3 insertions, 3 deletions

diff --git a/Changelog.md b/Changelog.md
index 84e209f..1d03e1e 100644
--- a/Changelog.md
+++ b/Changelog.md
@@ -6,7 +6,7 @@
 
 - **Logical operators on integers**: Not `!` (`not`), And `&&` (`and`)  and Or `||` (`or`) are available.  Only `0` is regarded as False and these operators return `1` for Truth, `0` for False.
 
-- **Bytecode optimisations*: Bytecodes are optimised by methods such as Copy propagation, Delete dead code. In addition, Register0 is used to store comparison results, and conditional branches are performed according to the value of Register0. To prevent those optimisation, comment out the following definition `OPTIMISE_IMCODE` in `src/inpla.y`:
+- **Bytecode optimisations**: Bytecodes are optimised by Copy propagation, Dead code elimination methods. In addition, Register0 is used to store comparison results, and conditional branches are performed according to the value of Register0. To prevent those optimisation, comment out the following definition `OPTIMISE_IMCODE` in `src/inpla.y`:
 
   ```
   #define OPTIMISE_IMCODE    // Optimise the intermediate codes
diff --git a/README.md b/README.md
index a44cd22..c990215 100644
--- a/README.md
+++ b/README.md
@@ -194,7 +194,7 @@ Inpla is a multi-threaded parallel interpreter of interaction nets. Once you wri
     
     
     // Nets
-    isort(r)~[3,6,1,9,2];
+    qsort(r)~[3,6,1,9,2];
     r;
     ```
 
@@ -225,7 +225,7 @@ Inpla is a multi-threaded parallel interpreter of interaction nets. Once you wri
                smaller, cnt << part(x,ys);
       
       // Nets
-      r << isort([3,6,1,9,2]);
+      r << qsort([3,6,1,9,2]);
       r;
       ```