You have a list of elements and their prices. Select your preferred lists from the item based on lowest price. So to complete the task you have a tool called selection sort. In selection sort: Select the minimum element from the unsorted part of the given array. Move the selected element to a sorted part of the array. • Repeat this process to make the unsorted array sorted. Here is pseudo code: for i0 to n – 1 argmin, (A[i], A[i + 1], .. A[n – 1]) m = ....... swap (A[i], A[m]) end for Use the above pseudo code to complete the selection sort. First line of the input will contain N items and M preferred choices (where M S N). The next line will contain the price of each element. Output will contain the price of M number of preferred elements. Input 1: 53 Input 2: 74 5 10 214 10 23 4 1 100 1 Output 1: 124 Output 2: 1123
You have a list of elements and their prices. Select your preferred lists from the item based on lowest price. So to complete the task you have a tool called selection sort. In selection sort: Select the minimum element from the unsorted part of the given array. Move the selected element to a sorted part of the array. • Repeat this process to make the unsorted array sorted. Here is pseudo code: for i0 to n – 1 argmin, (A[i], A[i + 1], .. A[n – 1]) m = ....... swap (A[i], A[m]) end for Use the above pseudo code to complete the selection sort. First line of the input will contain N items and M preferred choices (where M S N). The next line will contain the price of each element. Output will contain the price of M number of preferred elements. Input 1: 53 Input 2: 74 5 10 214 10 23 4 1 100 1 Output 1: 124 Output 2: 1123
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
Use python
![You have a list of elements and their prices. Select your preferred lists from the item
based on lowest price. So to complete the task you have a tool called selection sort.
In selection sort:
Select the minimum element from the unsorted part of the given array.
Move the selected element to a sorted part of the array.
• Repeat this process to make the unsorted array sorted.
Here is pseudo code:
for i + 0 to n – 1
argmin, (A[i], A[i + 1] .
A[n – 1])
m =
......
swap (A[i], A[m])
end for
Use the above pseudo code to complete the selection sort.
First line of the input will contain N items and M preferred choices (where MS N). The
next line will contain the price of each element. Output will contain the price of M
number of preferred elements.
Input 1:
53
Input 2:
74
5 10 214
10 23 4 1 100 1
Output 1:
124
Output 2:
1123](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F66922239-13a8-458c-9134-0ade0510ba00%2F3c0acea7-5c4a-4819-b5e0-416da5696577%2F6q3tq5w_processed.jpeg&w=3840&q=75)
Transcribed Image Text:You have a list of elements and their prices. Select your preferred lists from the item
based on lowest price. So to complete the task you have a tool called selection sort.
In selection sort:
Select the minimum element from the unsorted part of the given array.
Move the selected element to a sorted part of the array.
• Repeat this process to make the unsorted array sorted.
Here is pseudo code:
for i + 0 to n – 1
argmin, (A[i], A[i + 1] .
A[n – 1])
m =
......
swap (A[i], A[m])
end for
Use the above pseudo code to complete the selection sort.
First line of the input will contain N items and M preferred choices (where MS N). The
next line will contain the price of each element. Output will contain the price of M
number of preferred elements.
Input 1:
53
Input 2:
74
5 10 214
10 23 4 1 100 1
Output 1:
124
Output 2:
1123
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 3 steps with 3 images
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