You have a Positional List sorted in ascending order and a Stack sorted with the smallest element at the top and the largest element at the bottom. Merge all the elements of the stack into the Positional List such that the Positional List remains sorted in the same ascending order. Comment on the running time of your code. (For better grade, write your code efficiently such that the running time is low.) Suppose if your positional list is [0, 3, 6, 9, 12, 15, 18, 21, 24, 27] and Stack is 4 (Top) 12 16 20 24 28 (Bottom) Your final Positional List would be [0, 3, 4, 6, 8, 9, 12, 12, 15, 16, 18, 20, 21, 24, 24, 27, 28] Hints: from positional_list import Positionallist from array_stack import Arraystack L- Positionallist() S - Arraystack() for i in range(10): L.add_last(3*i) for i in range(28, 3, -4): S. push(i)
You have a Positional List sorted in ascending order and a Stack sorted with the smallest element at the top and the largest element at the bottom. Merge all the elements of the stack into the Positional List such that the Positional List remains sorted in the same ascending order. Comment on the running time of your code. (For better grade, write your code efficiently such that the running time is low.) Suppose if your positional list is [0, 3, 6, 9, 12, 15, 18, 21, 24, 27] and Stack is 4 (Top) 12 16 20 24 28 (Bottom) Your final Positional List would be [0, 3, 4, 6, 8, 9, 12, 12, 15, 16, 18, 20, 21, 24, 24, 27, 28] Hints: from positional_list import Positionallist from array_stack import Arraystack L- Positionallist() S - Arraystack() for i in range(10): L.add_last(3*i) for i in range(28, 3, -4): S. push(i)
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...
Related questions
Question
![In python , and please with the running time , and
please don't use appended. please continue the
code while adding the positional list and the
stack
You have a Positional List sorted in ascending order and a Stack sorted with the smallest element at
the top and the largest element at the bottom. Merge all the elements of the stack into the Positional
List such that the Positional List remains sorted in the same ascending order. Comment on the
running time of your code. (For better grade, write your code efficiently such that the running time is
low.)
Suppose if your positional list is [0, 3, 6, 9, 12, 15, 18, 21, 24, 27] and
Stack is
4 (Top)
12
16
20
24
28 (Bottom)
Your final Positional List would be [0, 3, 4, 6, 8,9, 12, 12, 15, 16, 18, 20, 21, 24, 24, 27, 28]
Hints:
from positional_list import Positionallist
from array_stack import Arraystack
L- Positionallist()
S - Arraystack()
for i in range(10):
L.add_last(3*i)
for i in range(28, 3, -4):
S. push(i)](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F2ae6e042-675d-44be-9133-f54a773db5e1%2F252d452e-7aea-49a8-a823-36ef4f0db154%2Fbcggjor_processed.jpeg&w=3840&q=75)
Transcribed Image Text:In python , and please with the running time , and
please don't use appended. please continue the
code while adding the positional list and the
stack
You have a Positional List sorted in ascending order and a Stack sorted with the smallest element at
the top and the largest element at the bottom. Merge all the elements of the stack into the Positional
List such that the Positional List remains sorted in the same ascending order. Comment on the
running time of your code. (For better grade, write your code efficiently such that the running time is
low.)
Suppose if your positional list is [0, 3, 6, 9, 12, 15, 18, 21, 24, 27] and
Stack is
4 (Top)
12
16
20
24
28 (Bottom)
Your final Positional List would be [0, 3, 4, 6, 8,9, 12, 12, 15, 16, 18, 20, 21, 24, 24, 27, 28]
Hints:
from positional_list import Positionallist
from array_stack import Arraystack
L- Positionallist()
S - Arraystack()
for i in range(10):
L.add_last(3*i)
for i in range(28, 3, -4):
S. push(i)
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Recommended textbooks for you
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
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
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY