We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 1937ace commit 6585fbdCopy full SHA for 6585fbd
Section_11(Hash-Table)/(2)_hash-table-linear-probing.py
@@ -28,12 +28,21 @@ def lprobe(self, element):
28
j = j + 1
29
return (i + j) % self.hashtable_size
30
31
- # Function to insert elements into the Hash Table
32
-
+ # Function to insert elements into the Hash Table
33
def insert(self, element):
34
i = self.hashcode(element)
35
if self.hashtable[i] == 0:
36
self.hashtable[i] = element
37
else:
38
i = self.lprobe(element)
39
+
40
+ # Function to search for an element in the Hash Table
41
+ def search(self, key):
42
+ i = self.hashcode(key)
43
+ j = 0
44
+ while self.hashtable[(i + j) % self.hashtable_size] != key:
45
+ if self.hashtable[(i + j) % self.hashtable_size] == 0:
46
+ return False
47
+ j = j + 1
48
+ return True
AltStyle によって変換されたページ (->オリジナル) / アドレス: モード: デフォルト 音声ブラウザ ルビ付き 配色反転 文字拡大 モバイル
0 commit comments