SophiaPretty

(5)

$14/per page/Negotiable

About SophiaPretty

Levels Tought:
Elementary,Middle School,High School,College,University,PHD

Expertise:
Accounting,Algebra See all
Accounting,Algebra,Applied Sciences,Architecture and Design,Art & Design,Biology,Business & Finance,Calculus,Chemistry,Communications,Computer Science,Economics,Engineering,English,Environmental science,Essay writing Hide all
Teaching Since: Jul 2017
Last Sign in: 314 Weeks Ago
Questions Answered: 15833
Tutorials Posted: 15827

Education

  • MBA,PHD, Juris Doctor
    Strayer,Devery,Harvard University
    Mar-1995 - Mar-2002

Experience

  • Manager Planning
    WalMart
    Mar-2001 - Feb-2009

Category > Computer Science Posted 16 Dec 2017 My Price 7.00

Output of the following Linear (Sequential) Search program

1) a- What is the Output of the following Linear (Sequential) Search program? It searches the given array for the number 52.    

    b- Write the one (or more) line of code that you would change in this program, so it will only output the first occurrence of the number 52 and then stops.                                                                        

import java.util.*;

 

public class MySeqSearch {

       

public static void main(String[] args)

{

int[] a = {99, 101, 8, -22, 3, 55, 42, -1, 0, 52, 33, -4, 66, 1, 52};    

System.out.println(Arrays.toString(a));

     int n = 52;

     System.out.println("Searching for number: " + n );

      boolean found = false;

      int i = 0;    

      while (!found || i < a.length )

      {             

        if (a[i] == n)

        {

         System.out.println(n + " is Found at index position " + i);

         found = true;

        }

      i++;

      }         

      if ( !found)

          System.out.println(n + " was Not Found!");    } }

---------------------------------

 

2)  A) Calculate the Big Oh performance for the Sequential Search on the array given below that has 15 elements? Given that sequential search of an array of 10 elements took on average 1 second.      

[ 99, 101, 8, -22, 3, 55, 42, -1, 0, 52, 33, -4, 66, 1, 52]

 

 B) Calculate the Big Oh performance for the Binary Search on the sorted array given below that has 15 elements? Given that Binary search of an array of 10 elements took on average 1 second. 

[ -22, -4, -1, 0, 1, 3, 8, 22, 42, 52, 52, 55, 66, 99, 101]

Answers

(5)
Status NEW Posted 16 Dec 2017 02:12 PM My Price 7.00

-----------  ----------- H-----------ell-----------o S-----------ir/-----------Mad-----------am ----------- Th-----------ank----------- yo-----------u f-----------or -----------you-----------r i-----------nte-----------res-----------t a-----------nd -----------buy-----------ing----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n. -----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be----------- qu-----------ick-----------ly

Not Rated(0)