Consider arrays A and B, each of which is indexed from 1 to n. The array entries are bank customer PIN numbers, where a PIN number is a sequence of exactly 3 digits (ex. 460 or 013 are each valid PINs). Array A consists of the PIN numbers of customers from bank A, and array B consists of the PIN numbers of customers from bank B. Your job is to design an algorithm that outputs all safe passwords from bank A. The safe passwords from bank A are those which are used by a customer from bank A but not also used by a customer in bank B. Write the pseudo-code for your algorithm, and justify why it runs in time O(n) in the worst-case.
please dont copy other website and the question asks for O(n) for algo
Consider arrays A and B, each of which is indexed from 1 to n. The array entries are bank customer
PIN numbers, where a PIN number is a sequence of exactly 3 digits (ex. 460 or 013 are each valid PINs).
Array A consists of the PIN numbers of customers from bank A, and array B consists of the PIN numbers
of customers from bank B. Your job is to design an
A. The safe passwords from bank A are those which are used by a customer from bank A but not also
used by a customer in bank B. Write the pseudo-code for your algorithm, and justify why it runs in time
O(n) in the worst-case.
Below algorithm displays all the Safe passwords from Bank A , i.e; All passwords used by customers from Bank A but not by customers in Bank B.
Step 1: START
Step 2: Declare two arrays A and B
Step 3: Read two arrays A and B
Step 4: Find Size of above two arrays and Store them in variables n and m.
Step 5: Initialize variable i ← 0
Step 6: Repeat the steps until i=(n-1)
6.1 Initialize variable j ← 0
6.2 Repeat the steps until j=(m-1)
6.2.1 If a[i] equals b[j]
Go to step 6.2.3
6.2.2 j ← j+1
6.3 If j equals m
Display a[i]
6.4 i ← i+1
Step 7: STOP
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
