Write an algorithm that compares each odd element with each even element of a list consisting of first m natural numbers, ie. 1. 2, 3 -.. m-, m, and for each comparison. puts the larger element into a new list A . Assume m is an even number, thus there are equal number of odd and even elements. At the end. algorithm should display number of times even number is larger than the odd number. L.write a pseudocodeand a python code. Execute with K=10 and present the output 2. What is the time complexity of this algorithm (worst)? 3. Extend the algorithm such that it searches for an odd-even pair which is sum is 10 and terminates when first such pair is found. 4. What is the time complexity (worst case) of the resulting algorithm?

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Question 41:
Write an algorithm that compares each odd element
with each even element of a list consisting of first m
natural numbers, ie. I. 2. 3. -.. m-, m. and for each
comparison, puts the larger element into a new list A
. Assume m is an even number, thus there are equal
number of odd and even elements. At the end,
algorithm should display number of times even number
is larger than the odd number.
1.write a pseudocodeand a python code. Execute with
K=10 and present the output.
2. What is the time complexity of this algorithm (worst)?
3. Extend the algorithm such that it searches for an
odd-even pair which is sum is 10 and terminates
when first such pair is found.
4. What is the time complexity (worst case) of the
resulting algorithm?
Transcribed Image Text:Question 41: Write an algorithm that compares each odd element with each even element of a list consisting of first m natural numbers, ie. I. 2. 3. -.. m-, m. and for each comparison, puts the larger element into a new list A . Assume m is an even number, thus there are equal number of odd and even elements. At the end, algorithm should display number of times even number is larger than the odd number. 1.write a pseudocodeand a python code. Execute with K=10 and present the output. 2. What is the time complexity of this algorithm (worst)? 3. Extend the algorithm such that it searches for an odd-even pair which is sum is 10 and terminates when first such pair is found. 4. What is the time complexity (worst case) of the resulting algorithm?
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY