//SequentialSearchMethod1.

java
// Implements Search Method 1 where the desired key may appear more than one
time in the table.
// Non-professional implementation of inventory record.

import java.util.Scanner;
public class SequentialSearchMethod1
{
public static void main( String args[ ])
{
Scanner input = new Scanner( System.in );

String name[ ] = { "kites", "pencils", "paper", "pens", "kites" };

double unitPrice [ ] = { 2.39, 16.78, 0.59, 10.00, 2.39 };

System.out.printf("%-10s%12s\n", "Item", "Price");

for( int bin = 0; bin < name.length; bin++)
System.out.printf("%-10s %10.2f\n", name[bin], unitPrice[bin]);

System.out.printf("/n%s", "Enter search key or 'Stop': ");

String schKey = input.next();

while ( !(schKey.equals("Stop")) ){
for( int bin = 0; bin < name.length; bin++)
if ( schKey.equalsIgnoreCase( name[bin] ) )
System.out.printf("%2d %-10s %10.2f\n", bin,
name[bin], unitPrice[bin]);
//end if
//end for
System.out.printf("\n%s", "Enter search key or 'Stop': ");

schKey = input.next();
} //end while

} // end main
}// end SequentialSearchMethod