From b9f65b81d73ce5a26e8d0a12a50853195ffa0762 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E8=8B=8F=E6=B7=9E=E4=B8=B0?=
 <50102735+Arctic2333@users.noreply.github.com>
Date: Tue, 3 Dec 2019 00:16:30 +0800
Subject: [PATCH] add function definitions

---
 search/hash_search.cpp | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/search/hash_search.cpp b/search/hash_search.cpp
index 6b0c0dbca..0428341b6 100644
--- a/search/hash_search.cpp
+++ b/search/hash_search.cpp
@@ -16,9 +16,9 @@ int counter = 1;
 int h(int key) {
     return key % HASHMAX;
 }
-// In this algorithm, we use the method of division and reservation remainder to construct the hash function, 
-// and use the method of chain address to solve the conflict, that is, we link a chain list after the data, 
-// and store all the records whose keywords are synonyms in the same linear chain list.
+/* In this algorithm, we use the method of division and reservation remainder to construct the hash function, 
+   and use the method of chain address to solve the conflict, that is, we link a chain list after the data, 
+   and store all the records whose keywords are synonyms in the same linear chain list. */
 void create_list(int key) {  // Construct hash table
     link p, n;
     int index;