From a96a06a77ae50e9bb044141052adfb8686523613 Mon Sep 17 00:00:00 2001
From: Vitali Fedulov <fedulov.vitali@gmail.com>
Date: Wed, 16 Mar 2022 18:53:45 +0100
Subject: [PATCH] -

---
 README.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/README.md b/README.md
index 486a5f6..c560a6b 100644
--- a/README.md
+++ b/README.md
@@ -4,10 +4,10 @@ This package allows fast approximate search of nearest neighbour vectors in n-di
 
 Its functions discretize a vector and generate a set of hashes, as described [here](https://vitali-fedulov.github.io/algorithm-for-hashing-high-dimensional-float-vectors.html) (also as [PDF](https://github.com/vitali-fedulov/research/blob/main/Algorithm%20for%20hashing%20float%20vectors.pdf)).
 
-To use the package follow the sequence of functions/methods:
+Usage sequence:
 1) CubeSet or CentralCube, depending which one is used for a database record and which one for a query.
 2) HashSet and DecimalHash to get corresponding hash set and central hash from results of (2). If DecimalHash is not suitable because of very large number of buckets or dimensions, use FNV1aHash to get both the hash set and the central hash).
 
 [Example](https://github.com/vitali-fedulov/images3/blob/master/hashes.go) of usage for image comparison.
 
-[Go doc](https://pkg.go.dev/github.com/vitali-fedulov/hyper) for the package.
+[Go doc](https://pkg.go.dev/github.com/vitali-fedulov/hyper) for code documentation.