The process or activity of writing computer programs.
Answer:
def brute_force(array1, array2):
for item in array1:
for element in array 2:
if element == item:
print(f"{element} and {item} are a match")
Explanation:
A brute-force algorithm is a direct-to-solution algorithm that searches and compares variables. It is like trying to unlock a safe but not knowing its four-digit combination, brute-force starts from 0000 through 9999 to get a match.
The python program implements the algorithm using two nested for loops. The first loop iterates over array1 while the second, over array2. For every item in the first array, the program loops through the length of the second array. For every match, the items are printed on the screen.
Answer:
Merge sort is a sorting technique based on divide and conquer technique.
Explanation:
MERGE(A, p, q, r)
n1 = q - p + 1
n2 = r - q
L[1..n1] and R[1..n2] this creates the new array
for i = 1 to n1
L[i] = A[p + i - 1]
for j = 1 to n2
R[j] = A[q + j]
i = 1
j = 1
for k = p to r
if i > n1
A[k] = R[j]
j = j + 1
else if j > n2
A[k] = L[i]
i = i + 1
else if L[i] ≤ R[j]
A[k] = L[i]
i = i + 1
else
A[k] = R[j]
j = j + 1
