swap Select 1 (the smallest) and swap it with 2 (the first) in the list. 2 9 5 4 8 1 6. swap The number 1 is now in the correct position, and thus no longer needs to be considered. Select 2 (the smallest) and swap it with 9 (the first) in the remaining list. 1 5 4 8 swap The number 2 is now in the correct position, and thus no longer needs to be considered. Select 4 (the smallest) and swap it with 5 (the first) in the remaining list. 5 4 8 9 6 The number 4 is now in the correct position, and thus no longer needs to be considered. 5 is the smallest and in the right position. No swap is necessary. 1 2 4 5 8 9 6 swap The number 5 is now in the correct position, and thus no longer needs to be considered. Select 6 (the smallest) and swap it with 8 (the first) in the remaining list. 1 2 4 5 8 9 swap The number 6 is now in the correct position, and thus no longer needs to be considered. Select 8 (the smallest) and swap it 1 2 4 5 6 with 9 (the first) in the remaining 8. list. The number 8 is now in the correct position, and thus no longer needs to be considered. 1 2 4 5 6 8 9 Since there is only one element remaining in the list, the sort is completed. FIGURE 7.11 Selection sort repeatedly selects the smallest number and swaps it with the first number in the list.
swap Select 1 (the smallest) and swap it with 2 (the first) in the list. 2 9 5 4 8 1 6. swap The number 1 is now in the correct position, and thus no longer needs to be considered. Select 2 (the smallest) and swap it with 9 (the first) in the remaining list. 1 5 4 8 swap The number 2 is now in the correct position, and thus no longer needs to be considered. Select 4 (the smallest) and swap it with 5 (the first) in the remaining list. 5 4 8 9 6 The number 4 is now in the correct position, and thus no longer needs to be considered. 5 is the smallest and in the right position. No swap is necessary. 1 2 4 5 8 9 6 swap The number 5 is now in the correct position, and thus no longer needs to be considered. Select 6 (the smallest) and swap it with 8 (the first) in the remaining list. 1 2 4 5 8 9 swap The number 6 is now in the correct position, and thus no longer needs to be considered. Select 8 (the smallest) and swap it 1 2 4 5 6 with 9 (the first) in the remaining 8. list. The number 8 is now in the correct position, and thus no longer needs to be considered. 1 2 4 5 6 8 9 Since there is only one element remaining in the list, the sort is completed. FIGURE 7.11 Selection sort repeatedly selects the smallest number and swaps it with the first number in the list.
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 Figure 7.11 as an example to show how to apply the selection-sort approach to sort {3.4, 5, 3, 3.5, 2.2, 1.9, 2}.
Transcribed Image Text:swap
Select 1 (the smallest) and swap it
with 2 (the first) in the list.
2
9
5
4
8
1
6.
swap
The number 1 is now in the
correct position, and thus no
longer needs to be considered.
Select 2 (the smallest) and swap it
with 9 (the first) in the remaining
list.
1
5
4
8
swap
The number 2 is now in the
correct position, and thus no
longer needs to be considered.
Select 4 (the smallest) and swap it
with 5 (the first) in the remaining
list.
5
4
8
9
6
The number 4 is now in the
correct position, and thus no
longer needs to be considered.
5 is the smallest and in the right
position. No swap is necessary.
1 2 4 5 8 9 6
swap
The number 5 is now in the
correct position, and thus no
longer needs to be considered.
Select 6 (the smallest) and swap it
with 8 (the first) in the remaining
list.
1 2 4 5
8
9
swap
The number 6 is now in the
correct position, and thus no
longer needs to be considered.
Select 8 (the smallest) and swap it
1 2 4 5 6
with 9 (the first) in the remaining
8.
list.
The number 8 is now in the
correct position, and thus no
longer needs to be considered.
1 2 4 5 6 8 9
Since there is only one element
remaining in the list, the sort is
completed.
FIGURE 7.11 Selection sort repeatedly selects the smallest number and swaps it with the first number in the list.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
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