1617878100
_Docker Captains are select members of the community that are both experts in their field and are passionate about sharing their Docker knowledge with others. “Docker Captains Take 5” is a regular blog series where we get a closer look at our Captains and ask them the same broad set of questions ranging from what their best Docker tip is to whether they prefer cats or dogs (personally, we like whales and turtles over here). Today, we’re interviewing Gianluca Arbezzano who has been a Docker Captain since 2016. He is a Senior Software Staff Engineer at Equinix Metal and is based in Italy. _
How/when did you first discover Docker?
At this point, it is not easy to pick a date. Four years ago I was in Dublin away from my home town near Turin. The Docker Meetup along with many other meetups were a great opportunity for nerds like me looking for new friends and to grab free pizza while having a good time. Back then I was working for a company that helps businesses move to the cloud. I saw that Docker was a powerful tool to master. Not only was Docker a useful tool and led me to meet a lot of cool people, but it also helped me to become a better open source citizen and enabled me to have some awesome experiences.
What is your favorite Docker command?
I am an old-style Docker user. Many of the new cool commands are unknown to me. One of the powerful combos I use from time to time is still “docker rm -fv $(docker ps -aq)”– I know, there are better ways! It clearly shows how powerful a good CLI tool and the UNIX philosophy are. I love buildkit, so buildx is also something I use a lot.
#community #community #developers #docker captains #docker community
1637592240
Eine lineare Suche, auch bekannt als sequentielle Suche, diese Methode wird verwendet, um ein Element innerhalb einer Liste oder eines Arrays zu finden. Es überprüft jedes Element der Liste nacheinander / sequentiell, bis eine Übereinstimmung gefunden wird oder die gesamte Liste durchsucht wurde.
Implementieren Sie die lineare Suche mit den folgenden Schritten:
target
Wert mit dem angegebenen Wert der Liste/des Arrays.-1
.# python program for linear search using while loop
#define list
lst = []
#take input list size
num = int(input("Enter size of list :- "))
for n in range(num):
#append element in list/array
numbers = int(input("Enter the array of %d element :- " %n))
lst.append(numbers)
#take input number to be find in list
x = int(input("Enter number to search in list :- "))
i = 0
flag = False
while i < len(lst):
if lst[i] == x:
flag = True
break
i = i + 1
if flag == 1:
print('{} was found at index {}.'.format(x, i))
else:
print('{} was not found.'.format(x))
Nach der Ausführung des Programms lautet die Ausgabe:
Enter size of list :- 5
Enter the array of 0 element :- 10
Enter the array of 1 element :- 23
Enter the array of 2 element :- 56
Enter the array of 3 element :- 89
Enter the array of 4 element :- 200
Enter number to search in list :- 89
89 was found at index 3.
# python program for linear search using for loop
#define list
lst = []
#take input list size
num = int(input("Enter size of list :- "))
for n in range(num):
#append element in list/array
numbers = int(input("Enter the array of %d element :- " %n))
lst.append(numbers)
#take input number to be find in list
x = int(input("Enter number to search in list :- "))
i = 0
flag = False
for i in range(len(lst)):
if lst[i] == x:
flag = True
break
if flag == 1:
print('{} was found at index {}.'.format(x, i))
else:
print('{} was not found.'.format(x))
Nach der Ausführung des Programms lautet die Ausgabe:
Enter size of list :- 6
Enter the array of 0 element :- 25
Enter the array of 1 element :- 50
Enter the array of 2 element :- 100
Enter the array of 3 element :- 200
Enter the array of 4 element :- 250
Enter the array of 5 element :- 650
Enter number to search in list :- 200
200 was found at index 3.
# python program for linear search using for loop
#define list
lst = []
#take input list size
num = int(input("Enter size of list :- "))
for n in range(num):
#append element in list/array
numbers = int(input("Enter the array of %d element :- " %n))
lst.append(numbers)
#take input number to be find in list
x = int(input("Enter number to search in list :- "))
# Recursive function to linear search x in arr[l..r]
def recLinearSearch( arr, l, r, x):
if r < l:
return -1
if arr[l] == x:
return l
if arr[r] == x:
return r
return recLinearSearch(arr, l+1, r-1, x)
res = recLinearSearch(lst, 0, len(lst)-1, x)
if res != -1:
print('{} was found at index {}.'.format(x, res))
else:
print('{} was not found.'.format(x))
Nach der Ausführung des Programms lautet die Ausgabe:
Enter size of list :- 5
Enter the array of 0 element :- 14
Enter the array of 1 element :- 25
Enter the array of 2 element :- 63
Enter the array of 3 element :- 42
Enter the array of 4 element :- 78
Enter number to search in list :- 78
78 was found at index 4.
1637563159
Trước hết, Tìm kiếm tuyến tính, còn được gọi là tìm kiếm tuần tự, phương pháp này được sử dụng để tìm một phần tử trong danh sách hoặc mảng. Nó kiểm tra từng phần tử của danh sách một / tuần tự cho đến khi tìm thấy một kết quả phù hợp hoặc toàn bộ danh sách đã được tìm kiếm.
Triển khai tìm kiếm tuyến tính theo các bước sau:
target
giá trị với giá trị đã cho của danh sách / mảng.-1
.# python program for linear search using while loop
#define list
lst = []
#take input list size
num = int(input("Enter size of list :- "))
for n in range(num):
#append element in list/array
numbers = int(input("Enter the array of %d element :- " %n))
lst.append(numbers)
#take input number to be find in list
x = int(input("Enter number to search in list :- "))
i = 0
flag = False
while i < len(lst):
if lst[i] == x:
flag = True
break
i = i + 1
if flag == 1:
print('{} was found at index {}.'.format(x, i))
else:
print('{} was not found.'.format(x))
Sau khi thực hiện chương trình, kết quả đầu ra sẽ là:
Enter size of list :- 5
Enter the array of 0 element :- 10
Enter the array of 1 element :- 23
Enter the array of 2 element :- 56
Enter the array of 3 element :- 89
Enter the array of 4 element :- 200
Enter number to search in list :- 89
89 was found at index 3.
# python program for linear search using for loop
#define list
lst = []
#take input list size
num = int(input("Enter size of list :- "))
for n in range(num):
#append element in list/array
numbers = int(input("Enter the array of %d element :- " %n))
lst.append(numbers)
#take input number to be find in list
x = int(input("Enter number to search in list :- "))
i = 0
flag = False
for i in range(len(lst)):
if lst[i] == x:
flag = True
break
if flag == 1:
print('{} was found at index {}.'.format(x, i))
else:
print('{} was not found.'.format(x))
Sau khi thực hiện chương trình, kết quả đầu ra sẽ là:
Enter size of list :- 6
Enter the array of 0 element :- 25
Enter the array of 1 element :- 50
Enter the array of 2 element :- 100
Enter the array of 3 element :- 200
Enter the array of 4 element :- 250
Enter the array of 5 element :- 650
Enter number to search in list :- 200
200 was found at index 3.
# python program for linear search using for loop
#define list
lst = []
#take input list size
num = int(input("Enter size of list :- "))
for n in range(num):
#append element in list/array
numbers = int(input("Enter the array of %d element :- " %n))
lst.append(numbers)
#take input number to be find in list
x = int(input("Enter number to search in list :- "))
# Recursive function to linear search x in arr[l..r]
def recLinearSearch( arr, l, r, x):
if r < l:
return -1
if arr[l] == x:
return l
if arr[r] == x:
return r
return recLinearSearch(arr, l+1, r-1, x)
res = recLinearSearch(lst, 0, len(lst)-1, x)
if res != -1:
print('{} was found at index {}.'.format(x, res))
else:
print('{} was not found.'.format(x))
Sau khi thực hiện chương trình, kết quả đầu ra sẽ là:
Enter size of list :- 5
Enter the array of 0 element :- 14
Enter the array of 1 element :- 25
Enter the array of 2 element :- 63
Enter the array of 3 element :- 42
Enter the array of 4 element :- 78
Enter number to search in list :- 78
78 was found at index 4.
1637592180
Прежде всего, линейный поиск, также известный как последовательный поиск, этот метод используется для поиска элемента в списке или массиве. Он проверяет каждый элемент списка один за другим / последовательно, пока не будет найдено совпадение или пока не будет выполнен поиск по всему списку.
Реализуйте линейный поиск, выполнив следующие шаги:
target
значение с заданным значением списка / массива.-1
.# python program for linear search using while loop
#define list
lst = []
#take input list size
num = int(input("Enter size of list :- "))
for n in range(num):
#append element in list/array
numbers = int(input("Enter the array of %d element :- " %n))
lst.append(numbers)
#take input number to be find in list
x = int(input("Enter number to search in list :- "))
i = 0
flag = False
while i < len(lst):
if lst[i] == x:
flag = True
break
i = i + 1
if flag == 1:
print('{} was found at index {}.'.format(x, i))
else:
print('{} was not found.'.format(x))
После выполнения программы вывод будет:
Enter size of list :- 5
Enter the array of 0 element :- 10
Enter the array of 1 element :- 23
Enter the array of 2 element :- 56
Enter the array of 3 element :- 89
Enter the array of 4 element :- 200
Enter number to search in list :- 89
89 was found at index 3.
# python program for linear search using for loop
#define list
lst = []
#take input list size
num = int(input("Enter size of list :- "))
for n in range(num):
#append element in list/array
numbers = int(input("Enter the array of %d element :- " %n))
lst.append(numbers)
#take input number to be find in list
x = int(input("Enter number to search in list :- "))
i = 0
flag = False
for i in range(len(lst)):
if lst[i] == x:
flag = True
break
if flag == 1:
print('{} was found at index {}.'.format(x, i))
else:
print('{} was not found.'.format(x))
После выполнения программы вывод будет:
Enter size of list :- 6
Enter the array of 0 element :- 25
Enter the array of 1 element :- 50
Enter the array of 2 element :- 100
Enter the array of 3 element :- 200
Enter the array of 4 element :- 250
Enter the array of 5 element :- 650
Enter number to search in list :- 200
200 was found at index 3.
# python program for linear search using for loop
#define list
lst = []
#take input list size
num = int(input("Enter size of list :- "))
for n in range(num):
#append element in list/array
numbers = int(input("Enter the array of %d element :- " %n))
lst.append(numbers)
#take input number to be find in list
x = int(input("Enter number to search in list :- "))
# Recursive function to linear search x in arr[l..r]
def recLinearSearch( arr, l, r, x):
if r < l:
return -1
if arr[l] == x:
return l
if arr[r] == x:
return r
return recLinearSearch(arr, l+1, r-1, x)
res = recLinearSearch(lst, 0, len(lst)-1, x)
if res != -1:
print('{} was found at index {}.'.format(x, res))
else:
print('{} was not found.'.format(x))
После выполнения программы вывод будет:
Enter size of list :- 5
Enter the array of 0 element :- 14
Enter the array of 1 element :- 25
Enter the array of 2 element :- 63
Enter the array of 3 element :- 42
Enter the array of 4 element :- 78
Enter number to search in list :- 78
78 was found at index 4.
1636296420
このチュートリアルでは、Pythonで線形検索プログラムを作成する方法を学習します。
まず、線形検索(シーケンシャル検索とも呼ばれます)は、リストまたは配列内の要素を見つけるために使用されます。一致するものが見つかるか、リスト全体が検索されるまで、リストの各要素を1つずつ/順番にチェックします。
以下の手順に従って線形検索を実装します。
target
値をリスト/配列の指定された値に関連付け ます。-1
ます。# python program for linear search using while loop
#define list
lst = []
#take input list size
num = int(input("Enter size of list :- "))
for n in range(num):
#append element in list/array
numbers = int(input("Enter the array of %d element :- " %n))
lst.append(numbers)
#take input number to be find in list
x = int(input("Enter number to search in list :- "))
i = 0
flag = False
while i < len(lst):
if lst[i] == x:
flag = True
break
i = i + 1
if flag == 1:
print('{} was found at index {}.'.format(x, i))
else:
print('{} was not found.'.format(x))
プログラムの実行後、出力は次のようになります。
Enter size of list :- 5
Enter the array of 0 element :- 10
Enter the array of 1 element :- 23
Enter the array of 2 element :- 56
Enter the array of 3 element :- 89
Enter the array of 4 element :- 200
Enter number to search in list :- 89
89 was found at index 3.
# python program for linear search using for loop
#define list
lst = []
#take input list size
num = int(input("Enter size of list :- "))
for n in range(num):
#append element in list/array
numbers = int(input("Enter the array of %d element :- " %n))
lst.append(numbers)
#take input number to be find in list
x = int(input("Enter number to search in list :- "))
i = 0
flag = False
for i in range(len(lst)):
if lst[i] == x:
flag = True
break
if flag == 1:
print('{} was found at index {}.'.format(x, i))
else:
print('{} was not found.'.format(x))
プログラムの実行後、出力は次のようになります。
Enter size of list :- 6
Enter the array of 0 element :- 25
Enter the array of 1 element :- 50
Enter the array of 2 element :- 100
Enter the array of 3 element :- 200
Enter the array of 4 element :- 250
Enter the array of 5 element :- 650
Enter number to search in list :- 200
200 was found at index 3.
# python program for linear search using for loop
#define list
lst = []
#take input list size
num = int(input("Enter size of list :- "))
for n in range(num):
#append element in list/array
numbers = int(input("Enter the array of %d element :- " %n))
lst.append(numbers)
#take input number to be find in list
x = int(input("Enter number to search in list :- "))
# Recursive function to linear search x in arr[l..r]
def recLinearSearch( arr, l, r, x):
if r < l:
return -1
if arr[l] == x:
return l
if arr[r] == x:
return r
return recLinearSearch(arr, l+1, r-1, x)
res = recLinearSearch(lst, 0, len(lst)-1, x)
if res != -1:
print('{} was found at index {}.'.format(x, res))
else:
print('{} was not found.'.format(x))
プログラムの実行後、出力は次のようになります。
Enter size of list :- 5
Enter the array of 0 element :- 14
Enter the array of 1 element :- 25
Enter the array of 2 element :- 63
Enter the array of 3 element :- 42
Enter the array of 4 element :- 78
Enter number to search in list :- 78
78 was found at index 4.
1637566860
En primer lugar, una búsqueda lineal, también conocida como búsqueda secuencial, este método se utiliza para encontrar un elemento dentro de una lista o matriz. Comprueba cada elemento de la lista uno por uno / secuencialmente hasta que se encuentra una coincidencia o se ha buscado en toda la lista.
Implemente la búsqueda lineal siguiendo los pasos a continuación:
target
valor con el valor dado de la lista / matriz.-1
.# python program for linear search using while loop
#define list
lst = []
#take input list size
num = int(input("Enter size of list :- "))
for n in range(num):
#append element in list/array
numbers = int(input("Enter the array of %d element :- " %n))
lst.append(numbers)
#take input number to be find in list
x = int(input("Enter number to search in list :- "))
i = 0
flag = False
while i < len(lst):
if lst[i] == x:
flag = True
break
i = i + 1
if flag == 1:
print('{} was found at index {}.'.format(x, i))
else:
print('{} was not found.'.format(x))
Después de ejecutar el programa, la salida será:
Enter size of list :- 5
Enter the array of 0 element :- 10
Enter the array of 1 element :- 23
Enter the array of 2 element :- 56
Enter the array of 3 element :- 89
Enter the array of 4 element :- 200
Enter number to search in list :- 89
89 was found at index 3.
# python program for linear search using for loop
#define list
lst = []
#take input list size
num = int(input("Enter size of list :- "))
for n in range(num):
#append element in list/array
numbers = int(input("Enter the array of %d element :- " %n))
lst.append(numbers)
#take input number to be find in list
x = int(input("Enter number to search in list :- "))
i = 0
flag = False
for i in range(len(lst)):
if lst[i] == x:
flag = True
break
if flag == 1:
print('{} was found at index {}.'.format(x, i))
else:
print('{} was not found.'.format(x))
Después de ejecutar el programa, la salida será:
Enter size of list :- 6
Enter the array of 0 element :- 25
Enter the array of 1 element :- 50
Enter the array of 2 element :- 100
Enter the array of 3 element :- 200
Enter the array of 4 element :- 250
Enter the array of 5 element :- 650
Enter number to search in list :- 200
200 was found at index 3.
# python program for linear search using for loop
#define list
lst = []
#take input list size
num = int(input("Enter size of list :- "))
for n in range(num):
#append element in list/array
numbers = int(input("Enter the array of %d element :- " %n))
lst.append(numbers)
#take input number to be find in list
x = int(input("Enter number to search in list :- "))
# Recursive function to linear search x in arr[l..r]
def recLinearSearch( arr, l, r, x):
if r < l:
return -1
if arr[l] == x:
return l
if arr[r] == x:
return r
return recLinearSearch(arr, l+1, r-1, x)
res = recLinearSearch(lst, 0, len(lst)-1, x)
if res != -1:
print('{} was found at index {}.'.format(x, res))
else:
print('{} was not found.'.format(x))
Después de ejecutar el programa, la salida será:
Enter size of list :- 5
Enter the array of 0 element :- 14
Enter the array of 1 element :- 25
Enter the array of 2 element :- 63
Enter the array of 3 element :- 42
Enter the array of 4 element :- 78
Enter number to search in list :- 78
78 was found at index 4.