-
Notifications
You must be signed in to change notification settings - Fork 58
/
Copy pathCrossSearch.py
49 lines (40 loc) · 1.29 KB
/
CrossSearch.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
from threading import Thread
import time
class SearchAlgorithm1:
def __init__(self, list_data: list, element):
self.element = element
self.list = list_data
self.searching = True
self.index = None
def search(self):
Thread(self.forward())
self.reverse()
return self.index
def reverse(self):
len_all = len(self.list)
for i in range(len(self.list) - 1):
try:
if not self.searching:
break
i = len_all - i
if self.list[i] == self.element:
self.searching = False
self.index = i
break
except Exception:
pass
def forward(self):
for i in range(len(self.list) - 1):
try:
if not self.searching:
break
if self.list[i] == self.element:
self.searching = False
self.index = i
break
except Exception:
pass
list_i = [i for i in range(800, 9800)]
print("Searching by my algorithm...")
index_element = SearchAlgorithm1(list_i, 8999).search()
print(index_element)