Your task is to modify the selection sort algorithm so that you find the largest element and swap it to the last position, then continue with the next-largest element and so on. Selection Sorter.java 2 3 5 6 ( 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 ESSELSK public class SelectionSorter This class sorts an array, using a modified selection sort algorithm 58 59 60 61 } "/ public SelectionSorter(int[] anArray) { a= anArray: > Sorts the array managed by this selection sorter. "/ public void sort() { } Constructs a selection sorter. @paran anArray the array to sort > } // TODO: add loop bounds for (int i;i>...--) ( } "/ private int maximumPosition(int to) { > int naxPos= maximumPosition (1): swap (maxPos, i); Finds the largest element in a subrange of the array. @paran to the last position in a to compare @return the position of the largest element in the range a[0] a[to] // your work here "/ private void swap(int i, int j) ( Swaps two entries of the array. @paran i the first position to swap @paran the second position to swap int temp = a[i]; a[i] = a[j]; a[j] temp; private int[] a; // this method is used to check your work. public static int[] check(int[] values) { SelectionSorter sorter new SelectionSorter(values); sorter.sort(); return values;
Your task is to modify the selection sort algorithm so that you find the largest element and swap it to the last position, then continue with the next-largest element and so on. Selection Sorter.java 2 3 5 6 ( 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 ESSELSK public class SelectionSorter This class sorts an array, using a modified selection sort algorithm 58 59 60 61 } "/ public SelectionSorter(int[] anArray) { a= anArray: > Sorts the array managed by this selection sorter. "/ public void sort() { } Constructs a selection sorter. @paran anArray the array to sort > } // TODO: add loop bounds for (int i;i>...--) ( } "/ private int maximumPosition(int to) { > int naxPos= maximumPosition (1): swap (maxPos, i); Finds the largest element in a subrange of the array. @paran to the last position in a to compare @return the position of the largest element in the range a[0] a[to] // your work here "/ private void swap(int i, int j) ( Swaps two entries of the array. @paran i the first position to swap @paran the second position to swap int temp = a[i]; a[i] = a[j]; a[j] temp; private int[] a; // this method is used to check your work. public static int[] check(int[] values) { SelectionSorter sorter new SelectionSorter(values); sorter.sort(); return values;
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
JAVA
![ki
Your task is to modify the selection sort algorithm so that you find the largest element and
swap it to the last position, then continue with the next-largest element and so on.
Selection Sorter.java
1 /**
2
3
S public class SelectionSorter
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
26
27
28
29
30
31
32
33
는
34
35
36
37
38
39
S
40
41
42
43
44
45
46
47
48
49
50
51
{
This class sorts an array, using a modified selection sort
algorithm
52
53
54
55
56
57
58
59
60
61 }
public SelectionSorter(int[] anArray)
{
}
}
/**
Sorts the array managed by this selection sorter.
public void sort()
{
Constructs a selection sorter.
@paran anArray the array to sort
}
/**
a = anArray:
}
// TODO: add loop bounds
for (int i... i>i--)
(
>
}
private int maximumPosition(int to)
{
// your work here
int maxPos maximumPosition(i);
swap (maxPos, i);
Finds the largest element in a subrange of the array.
@param to the last position in a to compare.
@return the position of the largest element in the
range a[0]. a[to]
private void swap(int i, int j
{
Swaps two entries of the array.
@paran i the first position to swap
@paran j the second position to swap
int temp = a[i];
a[i] = a[j];
a[j] temp;
private int[] a;
// this method is used to check your work
public static int[] check(int[] values)
{
SelectionSorter sorter new SelectionSorter(values);
sorter.sort();
return values;](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F1580620b-ec3d-48da-8d5f-e0e1d6dd1757%2Fc97ac654-d164-4411-ba22-5e9c90bb77f7%2Fjksafq8_processed.png&w=3840&q=75)
Transcribed Image Text:ki
Your task is to modify the selection sort algorithm so that you find the largest element and
swap it to the last position, then continue with the next-largest element and so on.
Selection Sorter.java
1 /**
2
3
S public class SelectionSorter
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
26
27
28
29
30
31
32
33
는
34
35
36
37
38
39
S
40
41
42
43
44
45
46
47
48
49
50
51
{
This class sorts an array, using a modified selection sort
algorithm
52
53
54
55
56
57
58
59
60
61 }
public SelectionSorter(int[] anArray)
{
}
}
/**
Sorts the array managed by this selection sorter.
public void sort()
{
Constructs a selection sorter.
@paran anArray the array to sort
}
/**
a = anArray:
}
// TODO: add loop bounds
for (int i... i>i--)
(
>
}
private int maximumPosition(int to)
{
// your work here
int maxPos maximumPosition(i);
swap (maxPos, i);
Finds the largest element in a subrange of the array.
@param to the last position in a to compare.
@return the position of the largest element in the
range a[0]. a[to]
private void swap(int i, int j
{
Swaps two entries of the array.
@paran i the first position to swap
@paran j the second position to swap
int temp = a[i];
a[i] = a[j];
a[j] temp;
private int[] a;
// this method is used to check your work
public static int[] check(int[] values)
{
SelectionSorter sorter new SelectionSorter(values);
sorter.sort();
return values;
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 4 steps with 2 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education