it purchases items of various quantities; valid quantities are greater than 0 and less than 100 Read the quantity for each 10 items from the keyboard and store each into an integer array; if Kim enters a quantity of 0, negative, or greater than 100, it should be rejected, and she should be queried for a valid entry 1. After the valid entries are complete, display the unsorted array content, pass the unsorted array to another method for sorting, and display of the sorted array; you can use the code below for sorting /* * To change this license header, choose License Heade
Kim Gigabit purchases items of various quantities; valid quantities are greater than 0 and less than 100
Read the quantity for each 10 items from the keyboard and store each into an integer array; if Kim enters a quantity of 0, negative, or greater than 100, it should be rejected, and she should be queried for a valid entry
1. After the valid entries are complete, display the unsorted array content, pass the unsorted array to another method for sorting, and display of the sorted array; you can use the code below for sorting
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
package sortascending;
public class Sortascending {
public static void sortAsc( int[] arrayToSort )
{
// Find the integer that should go in each cell j of
// the arrayToSort, from cell 0 to the end
for ( int j=0; j<arrayToSort.length-1; j++ )
{
// Find min: the index of the integer that should go into cell j.
// Look through the unsorted integers (those at j or higher)
int min = j;
for ( int k=j+1; k<arrayToSort.length; k++ )
if ( arrayToSort[k] < arrayToSort[min] ) min = k;
// Swap the int at j with the int at min
int tempVal = arrayToSort[j];
arrayToSort[j] = arrayToSort[min];
arrayToSort[min] = tempVal;
}
}
public static void main(String[] args) {
int[] itemsToSort = { 22, 15, 2, 18, 17, 2, 3, 19, 4, 11 };
// print out the array
System.out.println("initial itemsToSort: ");
for ( int items : itemsToSort )
System.out.print( items + ", " );
// sort itemsToSort
sortAsc( itemsToSort );
// display itemsToSort
System.out.println("\n\nsorted itemsToSort: ");
for ( int items : itemsToSort )
System.out.print( items + ", " );
System.out.println( );
}
}
![W
AutoSave
project2AStu - Read-Only - Compatibility Mode - Word
O Search (Alt+Q)
Abdul Karim Conteh AK
ff
File
Home
Insert
Draw
Design
Layout
References
Mailings
Review
View
Help
O Comments
A Share
Kim Gigabit purchase items of various quantities; valid quantities are greater than 0 and less than 100
Read the quantity for each 10 items from the keyboard and store each into an integer array; if Kim enters a quantity of
0, negative, or greater than 100, it should be rejected, and she should be queried for a valid entry
}
1. After the valid entries are complete, display the unsorted array content, pass the unsorted array to another method
for sorting, and display of the sorted array; you can use the code below for sorting
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
package sortascending:
public class Sortascending {
public static void şortasel int[] arravTosort)
{
// Find the integer that should go in each cell j of
// the arrayToSQt, from cell 0 to the end
for ( int j=0; j<arrayToSort.length-1; itt )
{
// Find min: the index of the integer that should go into cell j.
// Look through the unsorted integers (those at j or higher)
int min = j:
for ( int k=j+1; k<arravTosort.length; k++ )
if ( aravTosatik] < aravToSortimin] ) min = k;
// Swap the int at j with the int at min
int tempVal = arravToSartlil:
aravTosatlil = arayToSortimin);
arravTOSortimin] = tempVal:
}
}
public static void main(String(] args) {
int[] itemsTosert = {22, 15, 2, 18, 17, 2, 3, 19, 4, 11 :
// print out the array
Systemout Rintlb("initial itemsToSout: ":
for ( int items : itemsTosert)
System out print( items + ", "):
// sort itemsTosect
sortAsel itemsTasert ):
// display itemsTOsert
Systemout Rrintlal"\n\psQrted itemsTeSet: ");
for ( int items : itemsTosort)
System out print( items + ", "):
SvstemoutRintlal
Page 1 of 2
307 words
Accessibility: Unavailable
D Focus
63%
1:03 PM
* ? 41) D
12/6/2021](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F678fef96-64be-4096-a74a-c4eb0a405ee7%2Fcf41aa3e-5f7e-410c-b944-307c2f0779ec%2Fzflc2z4_processed.png&w=3840&q=75)
![AutoSave
project2AStu - Read-Only - Compatibility Mode - Word
O Search (Alt+Q)
Abdul Karim Conteh AK
ff
File
Home
Insert
Draw
Design
Layout
References
Mailings
Review
View
Help
O Comments
A Share
}
public static void main(String[] args) {
int[] itemsToSort = { 22, 15, 2, 18, 17, 2, 3, 19, 4, 11 :
// print out the array
System.out.println("initial itemsToSort: "):
for ( int items : įtemsToSort)
System.out.print( items + ", " );
O // sort itemsToSort
sortAsc( itemsToSort );
// display itemsIoSort
System.out.println("\n\nsorted itemsToSort: ");
for ( int items : įtemsToSort)
System.out.print( items + ", ");
System.out.println( ):
}
Project2AStu
}
Page 1 of 2
307 words
Accessibility: Unavailable
D Focus
90%
1:05 PM
* ? 4) D
12/6/2021
治](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F678fef96-64be-4096-a74a-c4eb0a405ee7%2Fcf41aa3e-5f7e-410c-b944-307c2f0779ec%2Fl2qq7f4_processed.png&w=3840&q=75)
Step by step
Solved in 2 steps with 1 images
