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 2. Modify the code below using the while loop
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
- 2. Modify the code below using the while loop
/*
* 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( );
}
}
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
