Modify the code so that it reads a file named city.txt into starray, then do the linear search CODE class LinSearchclass{ public static int findit( String[] starray, String lookforthis ) { for ( int j=0; j < starray.length; j++ ) if ( starray[j] != null ) if ( starray[j].equals( lookforthis) ) return j ; return -1 ; } } // public class Linsearch { public static void main(String[] args) { final int theSize = 10 ; String[] strarr = new String[ theSize ] ; strarr[0] = "Brooklyn" ; strarr[1] = "Queens" ; strarr[2] = "Phila" ; strarr[3] = "LA" ; strarr[4] = "Manhattan" ; strarr[6] = "Cincinnati" ; strarr[7] = "Pittsburgh" ; strarr[8] = "Albany" ; // show cells with data for (int j=0; j < strarr.length; j++ ) if ( strarr[j] != null ) System.out.println( j + ": " + strarr[j] ); // search for "Manhattan" int location = LinSearchclass.findit( strarr, "Manhattan" ); if ( location >= 0 ) System.out.println("Item found at index " + location); else System.out.println("Item not found" ); } }

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...
icon
Related questions
Question

Modify the code so that it reads a file named city.txt into starray, then do the linear search

CODE

class LinSearchclass{
  
  public static int findit( String[] starray, String lookforthis )
  {
     for ( int j=0; j  < starray.length; j++ )
       if ( starray[j] != null )
         if ( starray[j].equals( lookforthis) )
             return j ; 

     return -1 ;  
  }
}
 //
public class Linsearch {

    public static void main(String[] args) {
    final int theSize = 10 ;

    String[] strarr = new String[ theSize ] ;  

    strarr[0] = "Brooklyn" ;
    strarr[1] = "Queens" ;
    strarr[2] = "Phila" ;
    strarr[3] = "LA" ;
    strarr[4] = "Manhattan" ;
    strarr[6] = "Cincinnati" ;
    strarr[7] = "Pittsburgh" ;
    strarr[8] = "Albany" ;

    // show cells with data
    for (int j=0; j  < strarr.length; j++ )
      if ( strarr[j] != null )
        System.out.println( j + ": " + strarr[j] );

    // search for "Manhattan"
    int location = LinSearchclass.findit( strarr, "Manhattan" ); 
    if ( location >= 0 )
      System.out.println("Item found at index " + location);
    else
      System.out.println("Item not found" );
    }
    
}

Expert Solution
steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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 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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY