subject

Consider the following algorithm that determines if two arrays have no elements in common. Assume that (a) the first array has n elements and the second array has m elements and that (b) the comparison on line 3 is the operation that counts towards running time. 1 FOR each element x on the first array
2. FOR each element y on the second array
3 IF x is equal to y then THEN
4. DISPLAY found common element
5 HALT
6 ENDIF
7 ENDFOR
8 ENDFOR
9 DISPLAY no elements in common
Q5.1: What is the best-case scenario?
Q5.2: What is the exact number of operations for the best-case scenario in terms of n and m?
Q5.3: What is the big-oh for the best-case scenario?
Q5.4: What is the worst-case scenario?
Q5.5: What is the exact number of operations for the worst-case scenario in terms of n and m?
Q5.6: What is the big-oh for the worst-case scenario?

ansver
Answers: 3

Another question on Computers and Technology

question
Computers and Technology, 22.06.2019 21:30
Nathan wants to create multiple worksheet containing common formatting styles for his team members. which file extension him to save these worksheets? nathan to create multiple worksheets with common styles. he needs to save them with the extension.
Answers: 1
question
Computers and Technology, 23.06.2019 22:50
What is an rss reader used for? for creating a user account on a social new site
Answers: 2
question
Computers and Technology, 24.06.2019 00:00
Visualizing a game of “tag” to remember the meaning of contagious
Answers: 3
question
Computers and Technology, 24.06.2019 00:30
Match the sentence fragment in the first column with the appropriate ending in the second column. a little per favore?
Answers: 1
You know the right answer?
Consider the following algorithm that determines if two arrays have no elements in common. Assume th...
Questions
Questions on the website: 13722367