Update 'README.md'

This commit is contained in:
2022-08-15 16:19:49 +00:00
parent 078c0273bf
commit 58891020e8

View File

@@ -61,8 +61,5 @@ Running this program gives the following output:
[1, 3, 5, 7] is sorted: true
```
The fact that we know if a list is sorted allows us to use more efficient algorithms for `union(IntList, IntList)`, `intersection(IntList, IntList)`, `indexOf(int)`, `lastIndexOf()` and `uniq()`.